A strongly polynomial algorithm for the uniform balanced network flow problem

DOI10.1016/S0166-218X(97)88001-8zbMath0895.90087OpenAlexW2080124268MaRDI QIDQ1382257

Maria Grazia Scutellà

Publication date: 25 March 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

linear fractional combinatorial optimizationbalanced network flow

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Related Items (4)

The balanced traveling salesman problem ⋮ A branch-and-cut algorithm for the balanced traveling salesman problem ⋮ Balanced paths in acyclic networks: Tractable cases and related approaches ⋮ The quadratic balanced optimization problem

Cites Work

• Unnamed Item
• Balanced optimization problems
• Minimax linear programming problem
• Most and least uniform spanning trees
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A generalization of max flow—min cut

This page was built for publication: A strongly polynomial algorithm for the uniform balanced network flow problem