Design of survivable IP-over-optical networks
From MaRDI portal
Publication:863570
DOI10.1007/s10479-006-0047-2zbMath1106.90017OpenAlexW2005769301MaRDI QIDQ863570
Sylvie Borne, Eric Gourdin, Bernard Liau, Ali Ridha Mahjoub
Publication date: 5 February 2007
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0047-2
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)
Related Items
A new branch-and-cut approach for the generalized regenerator location problem, A polyhedral study of the capacity formulation of the multilayer network design problem, Solving survivable two-layer network design problems by metric inequalities, Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut, Hop-constrained node survivable network design: An application to MPLS over WDM
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The convex hull of two core capacitated network design problems
- Separating from the dominant of the spanning tree polytope
- Design of survivable networks
- Introduction to ABACUS -- a branch-and-cut system
- Two-edge connected spanning subgraphs and polyhedra
- A polyhedral approach to multicommodity survivable network design
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On two-connected subgraph polytopes
- Very Simple Methods for All Pairs Network Flow Analysis
- Optimal attack and reinforcement of a network
- A new approach to the maximum-flow problem
- Multi-Terminal Network Flows
- TSPLIB—A Traveling Salesman Problem Library
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem