Revisiting the 0,1 assignment problem

DOI10.1016/0024-3795(92)90450-OzbMath0743.90078MaRDI QIDQ1183142

Richard H. Warren

Publication date: 28 June 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

traveling salesmanassignmentHungarian method

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items

On classes of normalized matrices ⋮ Optimal arcs for the traveling salesman problem

Cites Work

• Classes of matrices for the traveling salesman problem
• A new look at the optimal assignment problem
• Classes of matrices associated with the optimal assignment problem
• Unnamed Item
• Unnamed Item