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

DOI10.1002/net.21667zbMath1390.90104OpenAlexW2203738488MaRDI QIDQ4642425

Pierre Pesneau, Virginie Gabrel, Luís Gouveia, Ibrahima Diarrassouba, Ali Ridha Mahjoub

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (2)

Layered graph approaches for combinatorial optimization problems ⋮ Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties

Uses Software

• CPLEX

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