Heuristic and exact algorithms for the simultaneous assignment problem

DOI10.1016/S0377-2217(99)00100-9zbMath0976.90062OpenAlexW1968752854MaRDI QIDQ1572972

Takeo Yamada, Yasushi Nasu

Publication date: 13 January 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00100-9

zbMATH Keywords

combinatorial optimizationlocal searchpegging testsimultaneous assignment problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (2)

Assignment problems: a golden anniversary survey ⋮ A MIP model for scheduling India's general elections and police movement

Cites Work

• A note on two problems in connexion with graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Heuristic and exact algorithms for the simultaneous assignment problem