Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.09.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134200749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage Robust Network Flow and Design Under Demand Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing of uncertain traffic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization-methodology and applications / 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 Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robustness approach to uncapacitated network design 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: Applying Robust Optimization to Capacity Expansion of One Location in Telecommunications with Demand Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial approaches to multiflow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Optimization for Power Systems Capacity Expansion under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete cost multicommodity network optimization problems and exact solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On robust maximum flow with polyhedral uncertainty sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-stage robust LP with RHS uncertainty: complexity results and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust capacity expansion of network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to robust network design in telecommunications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of a Feasible Flow in a Stochastic Transportation Network / rank
 
Normal rank

Latest revision as of 19:43, 2 July 2024

scientific article
Language Label Description Also known as
English
Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
scientific article

    Statements

    Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (English)
    0 references
    0 references
    5 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    robust optimization
    0 references
    network optimization
    0 references
    network flows
    0 references
    polyhedral uncertainty
    0 references
    multicommodity flows
    0 references
    0 references
    0 references