A reduction approach to the repeated assignment problem
From MaRDI portal
Publication:531433
DOI10.1016/J.EJOR.2010.10.027zbMATH Open1210.90114OpenAlexW2119029187MaRDI QIDQ531433FDOQ531433
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
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
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Assignment Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Assignment problems: a golden anniversary survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of a 3-dimensional assignment problem
- Title not available (Why is that?)
- 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
- Tabu search for the planar three-index assignment problem
- A pegging approach to the precedence-constrained knapsack problem
- On dual solutions of the linear assignment problem
- Two fast algorithms for all-pairs shortest paths
Cited In (4)
- A reverse point algorithm for the assignment problem of the assignment of jobs with less number persons than jobs
- Reduction approaches for robust shortest path problems
- An improved reduction method for the robust optimization of the assignment problem
- Reducing the elastic generalized assignment problem to the standard generalized assignment problem
Uses Software
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)
