Pages that link to "Item:Q2962560"
From MaRDI portal
The following pages link to The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560):
Displaying 5 items.
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients (Q2282559) (← links)
- A robust stochastic casualty collection points location problem (Q2315652) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
