Pages that link to "Item:Q3009752"

The following pages link to Approximability of Capacitated Network Design (Q3009752):

Displaying 13 items.

• On fixed cost \(k\)-flow problems (Q260248) (← links)
• The minimum vulnerability problem (Q487032) (← links)
• A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
• The convex hull of two core capacitated network design problems (Q689128) (← links)
• A characterization of the uncapacitated network design polytope (Q1200785) (← links)
• Feasibility in capacitated networks: The effect of individual arcs and nodes (Q1380444) (← links)
• Approximation algorithms for a capacitated network design problem (Q1879243) (← links)
• Optimal design of capacitated production networks (Q2443400) (← links)
• A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) (Q2946016) (← links)
• Complexity and Approximation of the Continuous Network Design Problem (Q2969620) (← links)
• Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
• A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)
• Algorithms – ESA 2005 (Q5475818) (← links)