Max-min matching problems with multiple assignments

DOI10.1007/BF02190106zbMath0870.90068MaRDI QIDQ1359459

V. Reddy Dondeti, Hamilton Emmons

Publication date: 6 July 1997

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

matchingHungarian methodjob assignmentbounds on assignmentsmax-min criterianode-splitting method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On the computational complexity of (maximum) class scheduling, On the computational complexity of (maximum) shift class scheduling, License class design: Complexity and algorithms, Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the bottleneck assignment problem
• A variation of the assignment problem
• The Constrained Bottleneck Problem in Networks
• Signature Methods for the Assignment Problem
• Solving the Assignment Problem by Relaxation
• The alternating basis algorithm for assignment problems
• Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem