Minimizing a linear multiplicative-type function under network flow constraints

DOI10.1016/S0167-6377(96)00040-5zbMath0882.90039MaRDI QIDQ1362518

Takahiro Utsunomiya, Takahito Kuno

Publication date: 5 August 1997

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

primal-dual algorithmproduct of two affine functionsbicriteria decision makingnonconvex network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Linear multiplicative programming
• Strongly polynomial time algorithms for certain concave minimization problems on networks
• A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
• A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• \(NP\)-hardness of linear multiplicative programming and related problems
• Mathematical Considerations on the Relationship between the Ordering of players and Winning Probability in Certain Types of Team Sports
• Strongly polynomial algorithm for a production-transportation problem with concave production cost
• A bad network problem for the simplex method and other minimum cost flow algorithms
• Fibonacci heaps and their uses in improved network optimization algorithms
• A polynomial time solvable concave network flow problem