An out-of-kilter method for the algebraic circulation problem
DOI10.1016/0166-218X(85)90055-1zbMath0562.90023OpenAlexW2052875329MaRDI QIDQ1057166
Publication date: 1985
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(85)90055-1
ordinal sumsminimum cost network flowalgebraic objectivesbottleneck objectivescirculation problemslexicographic multicriteria objectivesout-of-kilter methodscaling techniquessum objectives
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Deterministic network models in operations research (90B10) Programming in abstract spaces (90C48)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An out-of-kilter method for the algebraic circulation problem
- An algorithm for algebraic assignment problems
- Duality for algebraic linear programming
- Linear and combinatorial optimization in ordered algebraic structures
- A general Hungarian method for the algebraic transportation problem
- Monotone networks
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- Weakly admissible transformations for solving algebraic assignment and transportation problems
- Algebraic Linear Programming
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- An algebraic approach to assignment problems
- The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems
This page was built for publication: An out-of-kilter method for the algebraic circulation problem
