Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles

DOI10.1016/j.disopt.2007.08.002zbMath1168.90356OpenAlexW2151727533MaRDI QIDQ951116

Deepak Rajan, Atamtürk, Alper

Publication date: 29 October 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.08.002

zbMATH Keywords

polyhedrapartition inequalitiessurvivable network design\(p\)-cyclesmixed-integer rounding

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Related Items

Survivable network design with shared-protection routing, Valid inequalities and facets for multi‐module survivable network design problem

Uses Software

• SONET

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The convex hull of two core capacitated network design problems
• Source sink flows with capacity installation in batches
• Topological design of ring networks
• Cost-efficient network synthesis from leased lines
• SONET/SDH ring assignment with capacity constraints
• Bidirected and unidirected capacity installation in telecommunication networks.
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• A branch-and-cut algorithm for capacitated network design problems
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• On capacitated network design cut-set polyhedra
• Linear Programming under Uncertainty
• The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis
• Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type
• Connectivity-splitting models for survivable network design
• A directed cycle-based column-and-cut generation method for capacitated survivable network design
• Strong formulations for network design problems with connectivity requirements
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Network Design Using Cut Inequalities
• Shortest paths, single origin‐destination network design, and associated polyhedra
• Capacitated Network Design—Polyhedral Structure and Computation
• Integer Programming and Combinatorial Optimization
• Strong inequalities for capacitated survivable network design problems.