An improved reduction method for the robust optimization of the assignment problem
From MaRDI portal
Recommendations
- Exact and heuristic algorithms for the interval data robust assignment problem
- A reduction approach to the repeated assignment problem
- A variation of the assignment problem
- Heuristic and exact algorithms for the simultaneous assignment problem
- A note of reduced dimension optimization algorithm of assignment problem
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3709922 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- A pegging approach to the precedence-constrained knapsack problem
- Complexity of the min-max and min-max regret assignment problems
- Network flows. Theory, algorithms, and applications.
- Surrogate Constraint Duality in Mathematical Programming
Cited in
(5)- Size versus truncation robustness in the assignment problem
- A reduction approach to the repeated assignment problem
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Exact and heuristic algorithms for the interval data robust assignment problem
- A note on upper bounds to the robust knapsack problem with discrete scenarios
This page was built for publication: An improved reduction method for the robust optimization of the assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649882)
