Recoverable robust spanning tree problem under interval uncertainty representations (Q2410105): 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: Approximation of min-max and min-max regret versions of some combinatorial optimization problems / 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 recoverable robust spanning tree problem with interval costs is polynomially solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable robust shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable robust knapsacks: the discrete scenario case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recoverable robust traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the Weight of Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robust Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of robust spanning tree 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: Iterative Methods in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The most vital edges in the minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Network Optimization: Theory and Algorithms / rank
 
Normal rank

Latest revision as of 14:22, 14 July 2024

scientific article
Language Label Description Also known as
English
Recoverable robust spanning tree problem under interval uncertainty representations
scientific article

    Statements

    Recoverable robust spanning tree problem under interval uncertainty representations (English)
    0 references
    0 references
    0 references
    0 references
    17 October 2017
    0 references
    robust optimization
    0 references
    interval data
    0 references
    recovery
    0 references
    spanning tree
    0 references

    Identifiers