Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem

DOI10.1002/NET.21667zbMATH Open1390.90104OpenAlexW2203738488MaRDI QIDQ4642425FDOQ4642425

Pierre Pesneau, V. Gabrel, Luis Gouveia, A. R. Mahjoub, I. Diarrassouba

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

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

Recommendations

• The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
• New formulations and solution procedures for the hop constrained network design problem.
• Constrained rerouting in networks: an integer programming formulation
• The \(k\) edge-disjoint 3-hop-constrained paths polytope
• A formulation for a hop constrained survivable network design problem
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• Integer programming formulations for the two 4-hop-constrained paths problem
• On imposing connectivity constraints in integer programs
• Extended formulation for hop constrained distribution network configuration problems
• Optimization problems of the third edge-connectivity of graphs

zbMATH Keywords

edge-disjoint pathsflow\(k\)-edge-connectedsurvivable networkinteger programming formulationaggregated formulationshop-constrained pathseparated formulations

Mathematics Subject Classification ID

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

Cited In (6)

• Layered graph approaches for combinatorial optimization problems
• A computational study on integer programming formulations for hop-constrained survivable network design
• On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints
• Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties
• 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

Uses Software

• CPLEX

This page was built for publication: Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642425)