Linear and semi-assignment problems: A core oriented approach

DOI10.1016/0305-0548(96)00010-XzbMath0863.90113OpenAlexW2051866473MaRDI QIDQ2563894

A. Volgenant

Publication date: 6 January 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(96)00010-x

zbMATH Keywords

linear assignmentdense cost matrix

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Discrete location and assignment (90B80)

Related Items

Assignment problems: a golden anniversary survey, On the initialization methods of an exterior point algorithm for the assignment problem, Mass transportation and the consistency of the empirical optimal conditional locations, Solving the rectangular assignment problem and applications, Algorithms and codes for dense assignment problems: The state of the art, Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times, Matching of objects nodal points improvement using optimization, Linear assignment procedures

Cites Work

• Unnamed Item
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Primal-dual algorithms for the assignment problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• An in-core/out-of-core method for solving large scale assignment problems
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
• Finding the Shortest Route between Two Points in a Network
• On some techniques useful for solution of transportation network problems