Pages that link to "Item:Q3591305"
From MaRDI portal
The following pages link to Approximating Min-Max (Regret) Versions of Some Polynomial Problems (Q3591305):
Displayed 13 items.
- A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
- Maximizing the minimum voter satisfaction on spanning trees (Q732928) (← links)
- On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
- A note on maximizing the minimum voter satisfaction on spanning trees (Q991324) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504) (← links)
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
- A randomized algorithm for the min-Max selecting items problem with uncertain weights (Q2267304) (← links)
- A combination of flow shop scheduling and the shortest path problem (Q2354293) (← links)
- Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms (Q3196375) (← links)
- Approximating Single Machine Scheduling with Scenarios (Q3541793) (← links)
- Robust Postdonation Blood Screening Under Prevalence Rate Uncertainty (Q4969303) (← links)
- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives (Q5085488) (← links)