An \(s\)-\(t\) connection problem with adaptability (Q534328): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2010.12.018 / rank
Normal rank
 
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.dam.2010.12.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056325851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending scope of robust optimization: comprehensive robust counterparts of uncertain 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 Exact Subgraph Recoverable Robust Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most vital links and nodes in weighted networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Combinatorial Optimization with Exponential Scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage Robust Network Design with Exponential Scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4663414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robust shortest path problem. / 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
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2010.12.018 / rank
 
Normal rank

Latest revision as of 20:44, 9 December 2024

scientific article
Language Label Description Also known as
English
An \(s\)-\(t\) connection problem with adaptability
scientific article

    Statements

    An \(s\)-\(t\) connection problem with adaptability (English)
    0 references
    0 references
    0 references
    17 May 2011
    0 references
    robust optimization
    0 references
    \(s\)-\(t\) connectivity
    0 references
    shortest path
    0 references
    two-stage optimization
    0 references
    adaptability
    0 references

    Identifiers