Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: Approximation of min-max and min-max regret versions of some combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / 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: 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: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a constant factor approximation for minmax regret problems using a symmetry point scenario / 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: An approximation algorithm for interval data minmax regret combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / 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: On exact solutions for the minmax regret spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxation algorithm with a probabilistic guarantee for robust deviation optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robust shortest path problem. / rank
 
Normal rank

Latest revision as of 04:43, 15 July 2024

scientific article
Language Label Description Also known as
English
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
scientific article

    Statements

    Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (English)
    0 references
    0 references
    0 references
    16 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    robust optimization
    0 references
    minmax regret
    0 references
    ellipsoidal uncertainty
    0 references
    complexity
    0 references
    scenario relaxation
    0 references
    0 references
    0 references
    0 references