Valid inequalities and facets for multi‐module survivable network design problem

DOI10.1002/net.22122zbMath1529.90020OpenAlexW4293215694MaRDI QIDQ6179709

Kiavash Kianfar, Unnamed Author

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22122

zbMATH Keywords

integer programmingcutting planesnetwork designsurvivable network design\( n \)-step MIR\( n\)-step cutset inequalitiestelecommunication backbone network

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
• \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
• Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
• Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
• Topological design of ring networks
• A polyhedral approach to multicommodity survivable network design
• Cost-efficient network synthesis from leased lines
• SONET/SDH ring assignment with capacity constraints
• Telecommunication link restoration planning with multiple facility types
• On capacitated network design cut-set polyhedra
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
• The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis
• Solving the Capacitated Local Access Network Design Problem
• On cut-based inequalities for capacitated network design polyhedra
• A directed cycle-based column-and-cut generation method for capacitated survivable network design
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Shortest paths, single origin‐destination network design, and associated polyhedra
• Design of Survivable Networks: A survey
• An algorithm for finding a fundamental set of cycles of a graph
• Capacitated Network Design—Polyhedral Structure and Computation
• Strong inequalities for capacitated survivable network design problems.

This page was built for publication: Valid inequalities and facets for multi‐module survivable network design problem