Minmax regret solutions for minimax optimization problems with uncertainty
From MaRDI portal
Recommendations
- Minmax regret combinatorial optimization problems: an algorithmic perspective
- Min max min robust (relative) regret combinatorial optimization
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Randomized minmax regret for combinatorial optimization under uncertainty
Cites work
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
- A linear time algorithm for the maximum capacity path problem
- Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints
- Combinatorial Optimization with Rational Objective Functions
- Distance Constraints for Tree Network Multifacility Location Problems
- Distance-constrained multifacility minimax location problems on tree networks
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
- How to use expert advice
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1279217 (Why is no real title available?)
- scientific article; zbMATH DE number 663895 (Why is no real title available?)
- m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
- Minmax Regret Median Location on a Network Under Uncertainty
- Minmax-regret robust 1-median location on a tree
- Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations
- Robust discrete optimization and its applications
- Sensitivity Analysis in Minisum Facility Location Problems
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
- The Min-Max Spanning Tree Problem and some extensions
- Universal Portfolios
Cited in
(59)- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- Minmax regret combinatorial optimization problems with investments
- A double oracle approach to minmax regret optimization problems with interval data
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Facility location problems with uncertainty on the plane
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- Interval data minmax regret network optimization problems
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- On the complexity of minmax regret linear programming
- Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria
- Efficient algorithms for the minmax regret path center problem with length constraint on trees
- Minimizing maximum cost for a single machine under uncertainty of processing times
- Min max min robust (relative) regret combinatorial optimization
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
- Combinatorial two-stage minmax regret problems under interval uncertainty
- Risk-averse single machine scheduling: complexity and approximation
- Preference elicitation and robust winner determination for single- and multi-winner social choice
- Robust supply chain network design with multi-products for a company in the food sector
- An uncertainty management framework for industrial applications
- Schedule execution for two-machine flow-shop with interval processing times
- Lawler's minmax cost problem under uncertainty
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
- Constraint-based optimization and utility elicitation using the minimax decision criterion
- Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- The minmax regret permutation flow-shop problem with two jobs
- The two-echelon island fuel distribution problem
- Combinatorial optimization problems with balanced regret
- Fixed-point solutions to the regress problem in normative uncertainty
- Lawler's minmax cost algorithm: optimality conditions and uncertainty
- Minimax regret capacity identification
- Relative Robust and Adaptive Optimization
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Randomized minmax regret for combinatorial optimization under uncertainty
- An enhanced exact procedure for the absolute robust shortest path problem
- A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity
- Worst‐case allocation algorithms in a complex of operations with interval parameters
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- Minmax regret combinatorial optimization problems: an algorithmic perspective
- Optimal minimax rates against nonsmooth alternatives
- Linear Minimax Regret Estimation of Deterministic Parameters with Bounded Data Uncertainties
- A state-of-the-art survey on multi-scenario scheduling
- Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations
- Min-max relative regret for scheduling to minimize maximum lateness
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
- Fifty years of research in scheduling -- theory and applications
- Min-max relative regret for scheduling to minimize maximum lateness
- Algorithms and complexity analysis for robust single-machine scheduling problems
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Min-max regret robust optimization approach on interval data uncertainty
- Minimizing total weighted flow time of a set of jobs with interval processing times
This page was built for publication: Minmax regret solutions for minimax optimization problems with uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591541)
