A hybrid optimization approach for the Steiner \(k\)-connected network design problem

DOI10.1016/J.ENDM.2018.02.005zbMath1392.90042OpenAlexW2789264664MaRDI QIDQ1742248

Mohamed Khalil Labidi, Ibrahima Diarrassouba, Ali Ridha Mahjoub

Publication date: 11 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.02.005

zbMATH Keywords

Lagrangian relaxationparallel computinggenetic algorithmlarge scalehybridizationS\(k\)ESNDP

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25)

Uses Software

• TSPLIB
• COIN-OR
• LEMON

Cites Work

• Steiner problem in networks: A survey
• Strong formulations for network design problems with connectivity requirements
• Design of Survivable Networks: A survey

This page was built for publication: A hybrid optimization approach for the Steiner \(k\)-connected network design problem