Two node-disjoint hop-constrained survivable network design and polyhedra
From MaRDI portal
Publication:4642418
DOI10.1002/net.21679zbMath1390.90156OpenAlexW2327866749MaRDI QIDQ4642418
Hakan Kutucu, 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.21679
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)
Related Items
The separation problem of rounded capacity inequalities: some polynomial cases, On the complexity of the separation problem for rounded capacity inequalities, Trade-offs among degree, diameter, and number of paths