Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2008.09.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028589351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the min-max and min-max regret assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Min-Max (Regret) Versions of Some Polynomial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of min-max and min-max regret versions of some combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of single machine scheduling problems under scenario-based uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret solutions for minimax optimization problems with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of a class of combinatorial optimization problems with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of robust single facility location problems on networks with uncertain edge lengths. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret linear resource allocation problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and minimizing the relative regret in combinatorial optimization with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minmax regret permutation flow-shop problem with two jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret p-center location on a network with demand uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax Regret Median Location on a Network Under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval data minmax regret network optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of minmax regret linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization of contaminant sensor placement for community water systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax-regret robust 1-median location on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: α-Reliable p-minimax regret: A new model for strategic facility location modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Multiobjective Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: About the applicability of MCDA to some robustness problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret solution to linear programming problems with an interval objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust shortest path problem in series -- parallel multidigraphs with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy crop supply in France: a min-max regret approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of minimizing the total flow time with interval data and minmax regret criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic to minimax absolute regret for linear programs with interval objective function coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders decomposition approach for the robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the robust shortest path problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust shortest path problem with interval data via Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the robust shortest path problem with interval data. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Optimization of Large-Scale Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Problems: Reductibility and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust minimum spanning tree problem: compact and convex uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions and methods in decision-aid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robust shortest path problem. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:17, 1 July 2024

scientific article
Language Label Description Also known as
English
Min-max and min-max regret versions of combinatorial optimization problems: A survey
scientific article

    Statements

    Min-max and min-max regret versions of combinatorial optimization problems: A survey (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2009
    0 references
    min-max
    0 references
    min-max regret
    0 references
    combinatorial optimization
    0 references
    complexity
    0 references
    approximation
    0 references
    robustness
    0 references
    0 references
    0 references

    Identifiers