Weakly admissible transformations for solving algebraic assignment and transportation problems

DOI10.1007/BFb0120884zbMath0435.90108OpenAlexW125490878MaRDI QIDQ3875737

Rainer E. Burkard, Uwe T. Zimmermann

Publication date: 1980

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120884

zbMATH Keywords

semigroupspolynomial algorithmsshortest path algorithmsbottleneck objectivessum objectivesalgebraic assignment problemalgebraic transportation problemlexicographical objectivesweakly admissible transformations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Programming in abstract spaces (90C48) Semigroups (20M99)

Related Items

A condition for the strong regularity of matrices in the minimax algebra, Minimizing variation of production rates in just-in-time systems: A survey, Strong linear independence in bottleneck algebra, Perspectives of Monge properties in optimization, A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective, An algorithm for algebraic assignment problems, Duality for algebraic linear programming, Which matrices are immune against the transportation paradox?, Selected topics on assignment problems, Duality and admissible transformations in combinatorial optimization, An augmenting path method for solving linear bottleneck assignment problems, A general Hungarian method for the algebraic transportation problem, An augmenting path method for solving linear bottleneck transportation problems, Trapezoidal matrices and the bottleneck assignment problem, On three basic methods for solving bottleneck transportation problems, An out-of-kilter method for the algebraic circulation problem