An augmenting path method for solving linear bottleneck assignment problems

DOI10.1007/BF02252026zbMath0372.90099MaRDI QIDQ1244171

Uwe T. Zimmermann, Ulrich Derigs

Publication date: 1978

Published in: Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness, Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem, A fast algorithm for a class of bottleneck problems, Solution methods and computational investigations for the linear bottleneck assignment problem, The dominance assignment problem, The bottleneck generalized assignment problem, Task preference-based bottleneck assignment problem, An algorithm for algebraic assignment problems, An improved algorithm for two stage time minimization assignment problem, Duality for algebraic linear programming, Algorithm for the solution of the bottleneck assignment problem, Minimizing maximum weight of subsets of a maximum matching in a bipartite graph, A heuristic procedure for the crew rostering problem, Solving linear bottleneck assignment problems via strong spanning trees, Selected topics on assignment problems, A class of bottleneck expansion problems, Duality and admissible transformations in combinatorial optimization, Primal transportation and transshipment algorithms, On a pair of job-machine assignment problems with two stages, An augmenting path method for solving linear bottleneck transportation problems, The partial sum criterion for Steiner trees in graphs and shortest paths, Improved polynomial algorithms for robust bottleneck problems with interval data, Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems, A multi-level bottleneck assignment approach to the bus drivers' rostering problem, Alternate strategies for solving bottleneck assignment problems - analysis and computational results

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Weakly admissible transformations for solving algebraic assignment and transportation problems
• An algebraic approach to assignment problems
• Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
• Some remarks on the time transportation problem
• Time‐minimizing transportation problems
• Bottleneck extrema
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• On some techniques useful for solution of transportation network problems
• A Note on Assignment Problems
• Quicksort