Complexity of the min-max and min-max regret assignment problems
From MaRDI portal
(Redirected from Publication:813974)
Recommendations
- Complexity of the min-max (regret) versions of min cut problems
- Algorithms and Computation
- Exact and heuristic algorithms for the interval data robust assignment problem
- On the complexity of minmax regret linear programming
- On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty
Cites work
- A note on shortest path, assignment, and transportation problems
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Interval data minmax regret network optimization problems
- Minmax regret linear resource allocation problems.
- On the complexity of the robust spanning tree problem with interval data
- On the robust shortest path problem.
- Robust discrete optimization and its applications
- The robust spanning tree problem with interval data
Cited in
(48)- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robustness in operational research and decision aiding: a multi-faceted issue
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
- Minmax regret combinatorial optimization problems with investments
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Approximating the min-max (regret) selecting items problem
- Complexity of the robust weighted independent set problems on interval graphs
- A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
- Combinatorial two-stage minmax regret problems under interval uncertainty
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- Multistage robust discrete optimization via quantified integer programming
- Routing optimization under uncertainty
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- The Complexity of Bottleneck Labeled Graph Problems
- New models for the robust shortest path problem: complexity, resolution and generalization
- 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
- Efficient Algorithms for k-Regret Minimizing Sets
- An improved reduction method for the robust optimization of the assignment problem
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
- On the complexity of the assignment problem with ordinal data
- Algorithms and Computation
- The complexity of bottleneck labeled graph problems
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
- Exact and heuristic algorithms for the interval data robust assignment problem
- Minimizing the number of late jobs on a single machine under due date uncertainty
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Robust balanced optimization
- Complexity of the directed robust b-matching problem and its variants on different graph classes
- On the complexity of finding central configurations of the graph-generalized ( n^2 - 1 )-puzzle
- Robust approach to restricted items selection problem
- Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
- Complexity of the min-max (regret) versions of min cut problems
- On the approximability of minmax (regret) network optimization problems
This page was built for publication: Complexity of the min-max and min-max regret assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813974)
