Pages that link to "Item:Q1014933"
From MaRDI portal
The following pages link to Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933):
Displaying 50 items.
- Random walks on graphs with interval weights and precise marginals (Q274449) (← links)
- Minmax robustness for multi-objective optimization problems (Q297049) (← links)
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
- Heterogeneous beliefs, regret, and uncertainty: the role of speculation in energy price dynamics (Q319957) (← links)
- An integrated approach for planning a long-term care network with uncertainty, strategic policy and equity considerations (Q319978) (← links)
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
- On the recoverable robust traveling salesman problem (Q331985) (← links)
- On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
- Robust flows with losses and improvability in evacuation planning (Q339930) (← links)
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
- A bicriteria approach to robust optimization (Q342179) (← links)
- The robust set covering problem with interval data (Q367647) (← links)
- Complexity and in-approximability of a selection problem in robust optimization (Q385465) (← links)
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (Q408396) (← links)
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Pinpointing the complexity of the interval min-max regret knapsack problem (Q429656) (← links)
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509) (← links)
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
- Scenario based robust line balancing: Computational complexity (Q442208) (← links)
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
- Robust unit commitment with \(n-1\) security criteria (Q530420) (← links)
- On the approximability of robust spanning tree problems (Q620950) (← links)
- A model predictive control approach to the periodic implementation of the solutions of the optimal dynamic resource allocation problem (Q627082) (← links)
- Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Robust balanced optimization (Q668952) (← links)
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty (Q723948) (← links)
- Robust approach to restricted items selection problem (Q828685) (← links)
- Robustness-based approach for fuzzy multi-objective problems (Q828867) (← links)
- Query-competitive algorithms for cheapest set problems under uncertainty (Q899309) (← links)
- Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution (Q991475) (← links)
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights (Q1044085) (← links)
- A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty (Q1634054) (← links)
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← links)
- Algorithms and uncertainty sets for data-driven robust shortest path problems (Q1634306) (← links)
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions (Q1652010) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- Minmax regret combinatorial optimization problems with investments (Q1652341) (← links)
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
- The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
- Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157) (← links)
- Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop (Q1677019) (← links)
- On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
