Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
From MaRDI portal
Recommendations
- Branch and cut methods for network optimization
- A branch and cut algorithm for the hierarchical network design problem
- A branch-and-cut approach for minimum cost multi-level network design
- A branch-and-cut algorithm for two-level survivable network design problems
- A branch-and-cut algorithm for capacitated network design problems
- The two layer network design problem
- A branch-and-bound algorithm to solve a multi-level network optimization problem
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
Cites work
- A branch-and-cut algorithm for capacitated network design problems
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
- A traffic-grooming algorithm for wavelength-routed optical networks
- Aggregation and Mixed Integer Rounding to Solve MIPs
- An improved Benders decomposition applied to a multi-layer network design problem
- Capacitated Network Design—Polyhedral Structure and Computation
- Cost-efficient network synthesis from leased lines
- Designing WDM optical networks using branch-and-price
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- Minimum cost capacity installation for multicommodity network flows
- On capacitated network design cut-set polyhedra
- On cut-based inequalities for capacitated network design polyhedra
- On the spanning tree polyhedron
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Routing Through Virtual Paths in Layered Telecommunication Networks
- SCIP: solving constraint integer programs
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Source sink flows with capacity installation in batches
- The multi-layered network design problem
- Tight LP‐based lower bounds for wavelength conversion in optical networks
Cited in
(14)- Branch-and-cut methods for the network design problem with vulnerability constraints
- A branch-and-cut algorithm for capacitated network design problems
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
- Using GRASP for designing a layered network: a real IP/MPLS over DWDM application case
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- Towards optimizing the deployment of optical access networks
- A taxonomy of multilayer network design and a survey of transportation and telecommunication applications
- A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
- Multicommodity network design with discrete node costs
- Network design with grooming constraints
- Designing WDM optical networks using branch-and-price
- Solving survivable two-layer network design problems by metric inequalities
- A branch-and-cut approach for minimum cost multi-level network design
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
This page was built for publication: Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404461)
