k-Partition-based facets of the network design problem
Author:
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Spare-Capacity Assignment For Line Restoration Using a Single-Facility TypeOperations Research, 2002
- Design of Capacitated Multicommodity Networks with Multiple FacilitiesOperations Research, 2002
- A Cutting Plane Algorithm for Multicommodity Survivable Network Design ProblemsINFORMS Journal on Computing, 1998
- Capacitated Network Design—Polyhedral Structure and ComputationINFORMS Journal on Computing, 1996
- Network Design Using Cut InequalitiesSIAM Journal on Optimization, 1996
- A polyhedral approach to multicommodity survivable network designNumerische Mathematik, 1994
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity ConstraintsOperations Research, 1992
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity ConstraintsSIAM Journal on Discrete Mathematics, 1990
- An Algorithm for Designing Survivable NetworksAT&T Technical Journal, 1989
- Synthesis of a Communication NetworkJournal of the Society for Industrial and Applied Mathematics, 1964