A computational study on integer programming formulations for hop-constrained survivable network design
From MaRDI portal
Publication:6657263
DOI10.1016/J.DAM.2024.11.021MaRDI QIDQ6657263
Enrico Malaguti, Naga Venkata C. Gudapati, Michele Monaci, Paolo Paronuzzi
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Cites Work
- Hop constrained Steiner trees with multiple root nodes
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- On the hop-constrained survivable network design problem with reliable edges
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- Layered graph approaches for combinatorial optimization problems
- Extended formulation for hop constrained distribution network configuration problems
- Design of survivable networks with vulnerability constraints
- 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
- Steiner problem in networks: A survey
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Optimal Network Design with End-to-End Service Requirements
- Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
- Strong formulations for network design problems with connectivity requirements
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
- Connectivity Upgrade Models for Survivable Network Design
- Design of Survivable Networks: A survey
- Hop‐level flow formulation for the survivable network design with hop constraints problem
This page was built for publication: A computational study on integer programming formulations for hop-constrained survivable network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657263)
