A reduction approach to the repeated assignment problem

DOI10.1016/j.ejor.2010.10.027zbMath1210.90114OpenAlexW2119029187MaRDI QIDQ531433

Takeo Yamada, Daisuke Yokoya, Cees W. Duin

Publication date: 29 April 2011

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.10.027

zbMATH Keywords

combinatorial optimizationrelaxationpegging testrepeated assignment problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Reduction approaches for robust shortest path problems

Uses Software

• CPLEX
• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On dual solutions of the linear assignment problem
• Assignment problems: a golden anniversary survey
• Two fast algorithms for all-pairs shortest paths
• Lower bounds for the axial three-index assignment problem
• An algorithm for the planar three-index assignment problem
• Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem
• Complexity of a 3-dimensional assignment problem
• Tabu search for the planar three-index assignment problem
• A pegging approach to the precedence-constrained knapsack problem
• Assignment Problems

This page was built for publication: A reduction approach to the repeated assignment problem