Pages that link to "Item:Q4950814"

The following pages link to Routing Through Virtual Paths in Layered Telecommunication Networks (Q4950814):

Displaying 12 items.

• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
• Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
• Designing WDM optical networks using branch-and-price (Q387309) (← links)
• Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• An improved Benders decomposition applied to a multi-layer network design problem (Q1038109) (← links)
• Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984) (← links)
• The multi-layered network design problem (Q2370332) (← links)
• A taxonomy of multilayer network design and a survey of transportation and telecommunication applications (Q2673552) (← links)
• On the minimum cost multiple-source unsplittable flow problem (Q3004201) (← links)
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
• A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)