Min-max and min-max regret versions of combinatorial optimization problems: A survey
From MaRDI portal
Recommendations
- Minmax regret combinatorial optimization problems: an algorithmic perspective
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Min max min robust (relative) regret combinatorial optimization
- Minmax regret solutions for minimax optimization problems with uncertainty
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
Cites work
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A branch and bound algorithm for the robust shortest path problem with interval data.
- A branch and bound algorithm for the robust spanning tree problem with interval data
- A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- About the applicability of MCDA to some robustness problems
- Algorithms and Computation
- Algorithms and Computation
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- An exact algorithm for the robust shortest path problem with interval data
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems
- Approximating multiobjective knapsack problems
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Combinatorial Problems: Reductibility and Approximation
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Complexity of the min-max and min-max regret assignment problems
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Energy crop supply in France: a min-max regret approach
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1319606 (Why is no real title available?)
- Interval data minmax regret network optimization problems
- Minimax regret p-center location on a network with demand uncertainty
- Minimax regret solution to linear programming problems with an interval objective function
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Minmax regret linear resource allocation problems.
- Minmax Regret Median Location on a Network Under Uncertainty
- Minmax regret solutions for minimax optimization problems with uncertainty
- Minmax-regret robust 1-median location on a tree
- Multicriteria Optimization
- On the complexity of a class of combinatorial optimization problems with uncertainty
- On the complexity of minmax regret linear programming
- On the complexity of the robust spanning tree problem with interval data
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- On the robust shortest path problem.
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust optimization of contaminant sensor placement for community water systems
- Robust Optimization of Large-Scale Systems
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Robust solutions and methods in decision-aid
- The minmax regret permutation flow-shop problem with two jobs
- The Price of Robustness
- The robust minimum spanning tree problem: compact and convex uncertainty
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- The robust shortest path problem with interval data via Benders decomposition
- The robust spanning tree problem with interval data
- α-Reliable p-minimax regret: A new model for strategic facility location modeling
Cited in
(only showing first 100 items - show all)- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- Minmax regret solutions for minimax optimization problems with uncertainty
- A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- Minmax regret combinatorial optimization problems with investments
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- The robust (minmax regret) assembly line worker assignment and balancing problem
- Robust combinatorial optimization with knapsack uncertainty
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
- Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Ranking robustness and its application to evacuation planning
- A double oracle approach to minmax regret optimization problems with interval data
- Variable-sized uncertainty and inverse problems in robust optimization
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
- Minimizing the weighted sum of completion times under processing time uncertainty
- Formulation and algorithms for the robust maximal covering location problem
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
- A biobjective approach to recoverable robustness based on location planning
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Approximability of the robust representatives selection problem
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- Pessimistic, optimistic, and minimax regret approaches for linear programs under uncertainty
- On scenario aggregation to approximate robust combinatorial optimization problems
- Computing knapsack solutions with cardinality robustness
- Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria
- Min-max and min-max (relative) regret approaches to representatives selection problem
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- Superiority-inferiority modeling coupled minimax-regret analysis for energy management systems
- Oracle-based algorithms for binary two-stage robust optimization
- The trouble with the second quantifier
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- An adaptive robust optimization model for parallel machine scheduling
- Decision space robustness for multi-objective integer linear programming
- Robust pricing for airlines with partial information
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
- Minmax regret for sink location on dynamic flow paths with general capacities
- Flexible here-and-now decisions for two-stage multi-objective optimization: method and application to energy system design selection
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
- Robust min-max regret covering problems
- Robust combinatorial optimization with locally budgeted uncertainty
- Minimizing maximum cost for a single machine under uncertainty of processing times
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion
- Mixed uncertainty sets for robust combinatorial optimization
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
- Algorithms for the minmax regret path problem with interval data
- Min max min robust (relative) regret combinatorial optimization
- Combinatorial two-stage minmax regret problems under interval uncertainty
- Complexity results and exact algorithms for robust knapsack problems
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- Generating hard instances for robust combinatorial optimization
- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients
- Risk-averse single machine scheduling: complexity and approximation
- Preference elicitation and robust winner determination for single- and multi-winner social choice
- Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
- Competitive difference analysis of the cash management problem with uncertain demands
- Approximate cutting plane approaches for exact solutions to robust optimization problems
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
- Minmax regret k-sink location on a dynamic path network with uniform capacities
- Representative scenario construction and preprocessing for robust combinatorial optimization problems
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
- Lawler's minmax cost problem under uncertainty
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
- Bulk-robust combinatorial optimization
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
- A robust optimization model for distribution network design under a mixed integer set of scenarios
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty
- Combinatorial optimization problems with balanced regret
- Multi-material topology optimization for maximizing structural stability under thermo-mechanical loading
- Random walks on graphs with interval weights and precise marginals
- On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
- Just-in-time scheduling under scenario-based uncertainty
- ROPI -- a robust optimization programming interface for C++
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Minmax robustness for multi-objective optimization problems
- Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems
- Robustness in Multi-criteria Decision Aiding
- The lexicographic \(\alpha \)-robust knapsack problem
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- Heterogeneous beliefs, regret, and uncertainty: the role of speculation in energy price dynamics
- An integrated approach for planning a long-term care network with uncertainty, strategic policy and equity considerations
- The bipartite quadratic assignment problem and extensions
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- An algebraic framework for multi-objective and robust variants of path problems
- On the recoverable robust traveling salesman problem
- On exact solutions for the minmax regret spanning tree problem
- Robust flows with losses and improvability in evacuation planning
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- A bicriteria approach to robust optimization
This page was built for publication: Min-max and min-max regret versions of combinatorial optimization problems: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014933)
