Pages that link to "Item:Q1003488"
From MaRDI portal
The following pages link to Some tractable instances of interval data minmax regret problems (Q1003488):
Displaying 5 items.
- On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
- Complexity of minimizing the total flow time with interval data and minmax regret criterion (Q2433804) (← links)
- On a Class of Interval Data Minmax Regret CO Problems (Q5391890) (← links)