A Dual-Based Algorithm for Multi-Level Network Design

DOI10.1287/MNSC.40.5.567MaRDI QIDQ4302659zbMATH OpenOpenAlexFDO

Authors Anantaram Balakrishnan, Thomas L. Magnanti, P. Mirchandani

Publication date 21 August 1994

Published in Management Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/2380

zbMATH Keywords

hierarchical network designSteiner networkundirected networkdual-based algorithmdual ascent algorithmmulti-level network design

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Integer programming (90C10)

Recommendations

• A branch-and-cut approach for minimum cost multi-level network design
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• The hierarchical network design problem
• Algorithms for a multi-level network optimization problem

Cited in

(27)

• scientific article; zbMATH DE number 4152177 (Why is no real title available?)
• An Algorithm for the Design of Multitype Concentrator Networks
• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• Parallel algorithms for a multi-level network optimization problem
• A branch-and-bound algorithm to solve a multi-level network optimization problem
• A dynamic programming algorithm for the local access telecommunication network expansion problem
• Multi-level facility location problems
• Algorithms for a multi-level network optimization problem
• Branch-and-price algorithm for the resilient multi-level hop-constrained network design
• A global optimization algorithm for reliable network design
• Two-level rectilinear Steiner trees
• Using a hybrid of exact and genetic algorithms to design survivable networks
• A modified algorithm of multiplex networks generation based on overlapped links
• An augmented arborescence formulation for the two-level network design problem
• Methodological Advances and New Formulations for Bilevel Network Design Problems
• The Two Level Network Design Problem with Secondary Hop Constraints
• A taxonomy of multilayer network design and a survey of transportation and telecommunication applications
• Iterative improvement methods for a multiperiod network design problem
• Towards optimizing the deployment of optical access networks
• A branch and cut algorithm for the hierarchical network design problem
• The multi-weighted Steiner tree problem: A reformulation by intersection
• A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
• Optimizing splitter and fiber location in a multilevel optical FTTH network
• Optimal hierarchical system of a grid road network
• A branch-and-cut approach for minimum cost multi-level network design
• Optimal design of hierarchical networks with free main path extremes

This page was built for publication: A Dual-Based Algorithm for Multi-Level Network Design

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