A reduction approach to the repeated assignment problem

DOI10.1016/J.EJOR.2010.10.027MaRDI QIDQ531433zbMATHOpenAlexFDO

Authors Daisuke Yokoya, Cees Duin, Takeo Yamada

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)

Recommendations

• The assignment problem revisited
• An improved reduction method for the robust optimization of the assignment problem
• The recurrent method to solve the assignment problem
• A note of reduced dimension optimization algorithm of assignment problem
• On a Reduction for a Class of Resource Allocation Problems
• On solving a variation of the assignment problem
• A potential reduction approach to the frequency assignment problem
• An efficient approximation for the generalized assignment problem
• A new reduction method in integer programming
• Continuous reductions among combinatorial optimization problems

Cites work

• scientific article; zbMATH DE number 3862930 (Why is no real title available?)
• scientific article; zbMATH DE number 3470175 (Why is no real title available?)
• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A pegging approach to the precedence-constrained knapsack problem
• An algorithm for the planar three-index assignment problem
• Assignment Problems
• Assignment problems: a golden anniversary survey
• Complexity of a 3-dimensional assignment problem
• Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem
• Lower bounds for the axial three-index assignment problem
• Network flows. Theory, algorithms, and applications.
• On dual solutions of the linear assignment problem
• Tabu search for the planar three-index assignment problem
• Two fast algorithms for all-pairs shortest paths

Cited in

(4)

• An improved reduction method for the robust optimization of the assignment problem
• Reduction approaches for robust shortest path problems
• A reverse point algorithm for the assignment problem of the assignment of jobs with less number persons than jobs
• Reducing the elastic generalized assignment problem to the standard generalized assignment problem

Describes a project that uses

Uses Software

• CPLEX
• Algorithm 97

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

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