Pages that link to "Item:Q429655"
From MaRDI portal
The following pages link to Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655):
Displaying 13 items.
- Scenario based robust line balancing: Computational complexity (Q442208) (← links)
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
- Restricted robust uniform matroid maximization under interval uncertainty (Q879971) (← links)
- Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions (Q1652010) (← links)
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion (Q1881565) (← links)
- Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
- The minmax regret inverse maximum weight problem (Q2243298) (← links)
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion (Q2450748) (← links)
- Linear Minimax Regret Estimation of Deterministic Parameters with Bounded Data Uncertainties (Q5354120) (← links)
- On a Class of Interval Data Minmax Regret CO Problems (Q5391890) (← links)
- On the complexity of a class of combinatorial optimization problems with uncertainty (Q5935709) (← links)
