Minimizing a linear multiplicative-type function under network flow constraints

DOI10.1016/S0167-6377(96)00040-5MaRDI QIDQ1362518zbMATH OpenFDO

Authors Takahito Kuno, Takahiro Utsunomiya

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)

Recommendations

• scientific article; zbMATH DE number 1819781
• scientific article; zbMATH DE number 1157097
• On the minimization of a class of generalized linear functions on a flow polytope
• A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
• scientific article; zbMATH DE number 1984104

Cites work

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 757680 (Why is no real title available?)
• scientific article; zbMATH DE number 757683 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• A bad network problem for the simplex method and other minimum cost flow algorithms
• A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost
• A polynomial time solvable concave network flow problem
• A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Linear multiplicative programming
• Mathematical Considerations on the Relationship between the Ordering of players and Winning Probability in Certain Types of Team Sports
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Network flows. Theory, algorithms, and applications.
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Strongly polynomial algorithm for a production-transportation problem with concave production cost
• Strongly polynomial time algorithms for certain concave minimization problems on networks
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
• \(NP\)-hardness of linear multiplicative programming and related problems

Cited in

(4)

• On the minimization of a class of generalized linear functions on a flow polytope
• Increment of the objective function and optimality criterion for one non-homogeneous network flow programming problem
• scientific article; zbMATH DE number 1819781 (Why is no real title available?)
• scientific article; zbMATH DE number 3904297 (Why is no real title available?)

This page was built for publication: Minimizing a linear multiplicative-type function under network flow constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362518)