AN IMPROVED REDUCTION METHOD FOR THE ROBUST OPTIMIZATION OF THE ASSIGNMENT PROBLEM

DOI10.1142/S0217595912500327zbMath1251.90344OpenAlexW2050114102MaRDI QIDQ4649882

Takeo Yamada, Byungjun You, Daisuke Yokoya

Publication date: 15 November 2012

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595912500327

zbMATH Keywords

combinatorial optimizationrobust optimizationassignment problempegging test

Mathematics Subject Classification ID

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

Related Items (2)

Robust Metric Inequalities for Network Loading Under Demand Uncertainty ⋮ A note on upper bounds to the robust knapsack problem with discrete scenarios

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of the min-max and min-max regret assignment problems
• A pegging approach to the precedence-constrained knapsack problem
• Surrogate Constraint Duality in Mathematical Programming

This page was built for publication: AN IMPROVED REDUCTION METHOD FOR THE ROBUST OPTIMIZATION OF THE ASSIGNMENT PROBLEM