Polynomial-time identification of robust network flows under uncertain arc failures (Q839810): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: XPRESS / 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.1007/s11590-009-0125-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046849669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing residual flow under an arc destruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The wireless network jamming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Cost Routing on Stochastic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Network Interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow in a Multi-Terminal Network with Any One Arc Subject to Failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the history of the transportation and maximum flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724690 / rank
 
Normal rank

Revision as of 22:22, 1 July 2024

scientific article
Language Label Description Also known as
English
Polynomial-time identification of robust network flows under uncertain arc failures
scientific article

    Statements

    Polynomial-time identification of robust network flows under uncertain arc failures (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2009
    0 references
    network flows
    0 references
    minimum cost flow problems
    0 references
    linear programming
    0 references
    robust optimization
    0 references
    quantitative risk measures
    0 references
    conditional value-at-risk
    0 references

    Identifiers