Pages that link to "Item:Q968181"

The following pages link to Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181):

Displaying 23 items.

• Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty (Q339584) (← links)
• Scenario based robust line balancing: Computational complexity (Q442208) (← links)
• A comparison of routing sets for robust network design (Q479214) (← links)
• Robust optimization model for a dynamic network design problem under demand uncertainty (Q542103) (← links)
• On 2-stage robust LP with RHS uncertainty: complexity results and applications (Q628752) (← links)
• Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard (Q694182) (← links)
• On robust maximum flow with polyhedral uncertainty sets (Q839800) (← links)
• The maximum flow problem of uncertain network (Q903658) (← links)
• Robust network design in telecommunications under polytope demand uncertainty (Q976502) (← links)
• Multipolar robust optimization (Q1731824) (← links)
• \(k\)-adaptive routing for the robust network loading problem (Q1742208) (← links)
• A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
• Multi-service multi-facility network design under uncertainty (Q1761754) (← links)
• On the approximability of robust network design (Q1998836) (← links)
• Recent advances in robust optimization: an overview (Q2256312) (← links)
• The robust network loading problem with dynamic routing (Q2377165) (← links)
• A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
• Robust capacity assignment solutions for telecommunications networks with uncertain demands (Q2811313) (← links)
• A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem (Q2997796) (← links)
• Robust Metric Inequalities for Network Loading Under Demand Uncertainty (Q3455882) (← links)
• Hardness of robust network design (Q3593369) (← links)
• On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows (Q6065863) (← links)
• Affine routing for robust network design (Q6065910) (← links)