Heuristic and exact algorithms for the simultaneous assignment problem

DOI10.1016/S0377-2217(99)00100-9MaRDI QIDQ1572972zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 3989103
• Efficient dual simplex algorithms for the assignment problem
• The Probabilistic Analysis of a Heuristic for the Assignment Problem
• Selected topics on assignment problems
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm

Cites work

• A note on two problems in connexion with graphs
• Combinatorial optimization. Networks and matroids
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3709922 (Why is no real title available?)
• scientific article; zbMATH DE number 53116 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.

Cited in

(7)

• Heuristics and exact algorithms for solving the Monden problem
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A binary-rounding heuristic for multi-period variable-task-duration assignment problems
• A MIP model for scheduling India's general elections and police movement
• An improved reduction method for the robust optimization of the assignment problem
• Simultaneous eating algorithm and greedy algorithm in assignment problems
• Assignment problems: a golden anniversary survey

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

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