On the approximability of minmax (regret) network optimization problems (Q976089): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / 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 the min-max and min-max regret assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems / 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: The hardness of approximate optima in lattices, codes, and systems of linear equations / 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: Q4198056 / 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: On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of the relative robust shortest path problem with interval data / rank
 
Normal rank

Revision as of 21:56, 2 July 2024

scientific article
Language Label Description Also known as
English
On the approximability of minmax (regret) network optimization problems
scientific article

    Statements

    On the approximability of minmax (regret) network optimization problems (English)
    0 references
    0 references
    0 references
    16 June 2010
    0 references
    combinatorial problems
    0 references
    approximation
    0 references
    minmax
    0 references
    minmax regret
    0 references
    computational complexity
    0 references

    Identifiers