Branch-and-price algorithm for the resilient multi-level hop-constrained network design

DOI10.1016/j.ejor.2013.08.024zbMath1339.90090OpenAlexW1971321306MaRDI QIDQ297189

Michel Gendreau, Fernanda S. H. Souza, Geraldo Robson Mateus

Publication date: 24 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.024

zbMATH Keywords

integer programmingbranch-and-pricehop-constrainedmulti-levelresilience

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Related Items

Configuration‐based approach for topological problems in the design of wireless sensor networks

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The hierarchical network design problem
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• An augmented arborescence formulation for the two-level network design problem
• A branch and cut algorithm for the hierarchical network design problem
• Interior point stabilization for column generation
• The multi-weighted Steiner tree problem: A reformulation by intersection
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Designing Hierarchical Survivable Networks
• The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
• Integer programming formulations for the two 4-hop-constrained paths problem
• A Dual-Based Algorithm for Multi-Level Network Design
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem