Pages that link to "Item:Q1200785"

The following pages link to A characterization of the uncapacitated network design polytope (Q1200785):

Displaying 11 items.

• The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties (Q322558) (← links)
• Tree network design avoiding congestion (Q646180) (← links)
• Column generation in the integral simplex method (Q948677) (← links)
• A robustness approach to uncapacitated network design problems (Q1278322) (← links)
• A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
• An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (Q2052386) (← links)
• A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
• A characterization of the two-commodity network design problem (Q4509379) (← links)
• On the uncapacitatedK-commodity network design problem with zero flow-costs (Q4651736) (← links)
• A characterization of network representable polymatroids (Q5202490) (← links)
• A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)