A branch-and-cut approach for minimum cost multi-level network design

DOI10.1016/S0012-365X(00)00404-0MaRDI QIDQ5957748zbMATH OpenFDO

Authors Sunil Chopra, Chih-Yang Tsai

Publication date 3 July 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(00)00404-0

zbMATH Keywords

network design models

Mathematics Subject Classification ID

Integer programming (90C10) Network design and communication in computer systems (68M10)

Recommendations

• A branch and cut algorithm for the hierarchical network design problem
• A branch-and-bound algorithm to solve a multi-level network optimization problem
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
• Branch and cut methods for network optimization
• A branch-and-cut algorithm for capacitated network design problems
• scientific article; zbMATH DE number 1532274
• A branch‐and‐cut algorithm for hub network design problems with profits
• A branch-and-cut algorithm for two-level survivable network design problems
• A Dual-Based Algorithm for Multi-Level Network Design
• scientific article; zbMATH DE number 1927152

Cited in

(7)

• Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
• A branch-and-bound algorithm to solve a multi-level network optimization problem
• Towards optimizing the deployment of optical access networks
• A branch and cut algorithm for the hierarchical network design problem
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
• Optimal hierarchical system of a grid road network
• Optimal design of hierarchical networks with free main path extremes

This page was built for publication: A branch-and-cut approach for minimum cost multi-level network design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957748)