An in-core/out-of-core method for solving large scale assignment problems

DOI10.1007/BF01919285zbMath0627.90090MaRDI QIDQ3763916

A. Metz, Ulrich Derigs

Publication date: 1986

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

matchingassignment problemshortest augmenting pathsparse subgraphlarge bipartite graphsoutpricing/reoptimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) 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

A shortest augmenting path algorithm for dense and sparse linear assignment problems, On the Euclidean assignment problem, Solution methods and computational investigations for the linear bottleneck assignment problem, Solving (large scale) matching problems combinatorially, Linear and semi-assignment problems: A core oriented approach, Linear assignment procedures

Cites Work

• An efficient labeling technique for solving sparse assignment problems
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• A new algorithm for the assignment problem
• The zero pivot phenomenon in transportation and assignment problems and its computational implications