Revisiting the 0,1 assignment problem

DOI10.1016/0024-3795(92)90450-OMaRDI QIDQ1183142zbMATH OpenFDO

Authors Richard H. Warren

Publication date 28 June 1992

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

Full work available at URL https://doi.org/10.1016/0024-3795(92)90450-O

zbMATH Keywords

assignmentHungarian methodtraveling salesman

Mathematics Subject Classification ID

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

Recommendations

• Contributions to the hungarian method
• scientific article; zbMATH DE number 1179832
• A note on Hungarian algorithm for assignment problems
• The Hungarian method for the assignment problem
• scientific article; zbMATH DE number 4081306

Cites work

• A new look at the optimal assignment problem
• Classes of matrices associated with the optimal assignment problem
• Classes of matrices for the traveling salesman problem
• scientific article; zbMATH DE number 3733647 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)

Cited in

(9)

• Classes of matrices associated with the optimal assignment problem
• Optimal arcs for the traveling salesman problem
• On the finite transmission zero assignment problem
• On classes of normalized matrices
• A new method of solving assignment problems -- the target value submatrix method
• On the problem of transversal selection
• scientific article; zbMATH DE number 4081306 (Why is no real title available?)
• Classes of matrices for the traveling salesman problem
• Admissible transformations and assignment problems

This page was built for publication: Revisiting the 0,1 assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1183142)