Pages that link to "Item:Q1014933"

The following pages link to Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933):

Displaying 50 items.

• 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)
• Ranking robustness and its application to evacuation planning (Q1681390) (← links)
• A double oracle approach to minmax regret optimization problems with interval data (Q1683128) (← links)
• Variable-sized uncertainty and inverse problems in robust optimization (Q1694311) (← links)
• Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
• Complexity of strict robust integer minimum cost flow problems: an overview and further results (Q1725614) (← links)
• Robust combinatorial optimization under budgeted-ellipsoidal uncertainty (Q1731817) (← links)
• Minimizing the weighted sum of completion times under processing time uncertainty (Q1742192) (← links)
• Formulation and algorithms for the robust maximal covering location problem (Q1742214) (← links)
• Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (Q1750469) (← links)
• A biobjective approach to recoverable robustness based on location planning (Q1753588) (← links)
• Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
• Approximability of the robust representatives selection problem (Q1785311) (← links)
• Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion (Q1790193) (← links)
• Pessimistic, optimistic, and minimax regret approaches for linear programs under uncertainty (Q1794445) (← links)
• On scenario aggregation to approximate robust combinatorial optimization problems (Q1800442) (← links)
• Computing knapsack solutions with cardinality robustness (Q1926647) (← links)
• Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria (Q1926791) (← links)
• Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
• A single-machine scheduling problem with uncertainty in processing times and outsourcing costs (Q1992893) (← links)
• Superiority-inferiority modeling coupled minimax-regret analysis for energy management systems (Q1994443) (← links)
• Oracle-based algorithms for binary two-stage robust optimization (Q2023665) (← links)
• The trouble with the second quantifier (Q2044549) (← links)
• Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
• An adaptive robust optimization model for parallel machine scheduling (Q2106719) (← links)
• Decision space robustness for multi-objective integer linear programming (Q2108813) (← links)
• Robust pricing for airlines with partial information (Q2115756) (← links)
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
• Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
• Flexible here-and-now decisions for two-stage multi-objective optimization: method and application to energy system design selection (Q2139143) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
• Robust min-max regret covering problems (Q2162527) (← links)
• Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
• Minimizing maximum cost for a single machine under uncertainty of processing times (Q2184134) (← links)
• Approximating combinatorial optimization problems with the ordered weighted averaging criterion (Q2189877) (← links)
• Mixed uncertainty sets for robust combinatorial optimization (Q2192978) (← links)
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• Min max min robust (relative) regret combinatorial optimization (Q2216185) (← links)
• Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
• Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
• A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050) (← links)
• Generating hard instances for robust combinatorial optimization (Q2272296) (← links)
• Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients (Q2282559) (← links)
• Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)