default search action

combined dblp search
author search
venue search
publication search

ask others

Takahiro Utsunomiya

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

2000
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/KunoU00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/KunoU00
Takahito Kuno, Takahiro Utsunomiya:
A Lagrangian Based Branch-and-Bound Algorithm for Production-transportation Problems. J. Glob. Optim. 18(1): 59-73 (2000)
1997
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/KunoU97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/KunoU97
Takahito Kuno, Takahiro Utsunomiya:
A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem. J. Glob. Optim. 11(2): 163-180 (1997)
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/orl/KunoU97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/KunoU97
Takahito Kuno, Takahiro Utsunomiya:
Minimizing a linear multiplicative-type function under network flow constraints. Oper. Res. Lett. 20(3): 141-148 (1997)
1996
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/KunoU96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/KunoU96
Takahito Kuno, Takahiro Utsunomiya:
A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost. J. Glob. Optim. 8(1): 67-80 (1996)

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.