Abstract
We present an overview of mathematical optimization models and solution algorithms related to optimal network design and dimensioning in telecommunications. All the models discussed are expressed in terras of minimum cost multicommodity network flows with appropriate choice of link (or node) cost functions. Various special cases related to practical applications are examined, including the linear case, the linear with fixed cost case, and the case of general discontinuous nondecreasing cost functions. It is also shown how the generic models presented can accommodate a variety of constraints frequently encountered in applications, such as, among others, constraints on the choice of routes, robustness and survivability constraints. Finally we provide an overview of recent developments in solution algorithms, emphasizing those approaches capable of finding provably exact solutions, which are essentially based on general mixed integer programming techniques, relaxation, cutting-plane generation techniques and branch & cut.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
