On the complexity of a class of combinatorial optimization problems with uncertainty
From MaRDI portal
Recommendations
- Minmax regret combinatorial optimization problems: an algorithmic perspective
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- On the complexity of minmax regret linear programming
Cited in
(90)- Approximation with a fixed number of solutions of some multiobjective maximization problems
- Scheduling with uncertainties on new computing platforms
- Robust approach to restricted items selection problem
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- Robust resource allocations in temporal networks
- Robust location of new housing developments using a choice model
- Benchmarking problems for robust discrete optimization
- Choosing robust solutions in discrete optimization problems with fuzzy costs
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity
- The minmax regret permutation flow-shop problem with two jobs
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Robust combinatorial optimization problems under budgeted interdiction uncertainty
- Strong formulations of robust mixed 0-1 programming
- Controlling risk and demand ambiguity in newsvendor models
- Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations
- Complexity of the robust weighted independent set problems on interval graphs
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
- Robust recoverable and two-stage selection problems
- Restricted robust uniform matroid maximization under interval uncertainty
- Probabilistic models for the Steiner tree problem
- Minmax regret maximal covering location problems with edge demands
- Ordered weighted average optimization in multiobjective spanning tree problem
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Robust optimization analysis for multiple attribute decision making problems with imprecise information
- On combinatorial optimization problems on matroids with uncertain weights
- Robust maximum weighted independent-set problems on interval graphs
- Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
- Minmax regret location--allocation problem on a network under uncertainty
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- Interval data minmax regret network optimization problems
- On the approximability of minmax (regret) network optimization problems
- Some tractable instances of interval data minmax regret problems
- Robust mean absolute deviation problems on networks with linear vertex weights
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- Minimax regret spanning arborescences under uncertain costs
- On a Class of Interval Data Minmax Regret CO Problems
- Distributionally robust discrete optimization with entropic Value-at-Risk
- On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Robust Algorithms for TSP and Steiner Tree
- Robust algorithms for TSP and Steiner tree
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
- Recoverable robust representatives selection problems with discrete budgeted uncertainty
- Using the WOWA operator in robust discrete optimization problems
- Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty
- Minmax regret linear resource allocation problems.
- The robust set covering problem with interval data
- Combinatorial optimization under uncertainty
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Combinatorial optimization problems with uncertain costs and the OWA criterion
- Exact and heuristic algorithms for the interval data robust assignment problem
- Facility location problems with uncertainty on the plane
- New models for the robust shortest path problem: complexity, resolution and generalization
- Constrained shortest path with uncertain transit times
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Towards a robust scheduling on unrelated parallel machines: a scenarios based approach
- Complexity results and exact algorithms for robust knapsack problems
- Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
- The robust vehicle routing problem with synchronization: models and branch-and-cut algorithms
- On the complexity of minmax regret linear programming
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Combinatorial optimization problems with balanced regret
- On discrete optimization with ordering
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
- Optimization under Uncertainty via CometBoards
- The computational complexity of the relative robust shortest path problem with interval data
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
- Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective
- Almost robust discrete optimization
- On the complexity of nonoverlapping multivariate marginal bounds for probabilistic combinatorial optimization problems
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion
- Min-max regret robust optimization approach on interval data uncertainty
- scientific article; zbMATH DE number 7075885 (Why is no real title available?)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
- A Benders decomposition approach for the robust spanning tree problem with interval data
- Combinatorial two-stage minmax regret problems under interval uncertainty
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty
This page was built for publication: On the complexity of a class of combinatorial optimization problems with uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935709)
