An out-of-kilter method for the algebraic circulation problem
DOI10.1016/0166-218X(85)90055-1zbMATH Open0562.90023OpenAlexW2052875329MaRDI QIDQ1057166FDOQ1057166
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
Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Programming in abstract spaces (90C48)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Linear and combinatorial optimization in ordered algebraic structures
- Monotone networks
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- An algebraic approach to assignment problems
- Weakly admissible transformations for solving algebraic assignment and transportation problems
- An out-of-kilter method for the algebraic circulation problem
- An algorithm for algebraic assignment problems
- Duality for algebraic linear programming
- A general Hungarian method for the algebraic transportation problem
- Algebraic Linear Programming
- The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems
Cited In (2)
This page was built for publication: An out-of-kilter method for the algebraic circulation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1057166)