An extension of the Munkres algorithm for the assignment problem to rectangular matrices

DOI10.1145/362919.362945zbMath0223.90023OpenAlexW1975675300MaRDI QIDQ5629432

Jean-Claude Lassalle, François Bourgeois

Publication date: 1971

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/362919.362945

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (10)

Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking ⋮ Simple matching vs linear assignment in scheduling models with positional effects: a critical review ⋮ Gas flow measurements by 3D particle tracking velocimetry using coloured tracer particles ⋮ Multi-machine scheduling with interval constrained position-dependent processing times ⋮ Multi-machine scheduling with general position-based deterioration to minimize total load revisited ⋮ Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies ⋮ Un algorithme combinatoire pour la résolution des problèmes du type du permanent ⋮ A computational auditory scene analysis-enhanced beamforming approach for sound source separation ⋮ Restricted set classification: who is there? ⋮ Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure

This page was built for publication: An extension of the Munkres algorithm for the assignment problem to rectangular matrices