Exact and approximate algorithms for optimal network design

DOI10.1002/net.3230090104zbMath0397.94024OpenAlexW2133615887MaRDI QIDQ4182675

Rene Dionne, Michael Florian

Publication date: 1979

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230090104

zbMATH Keywords

Algorithms for Optimal Network DesignFinding a Connected SubgraphNp- Complete ProblemsSum of the Weighted Shortest Distances

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items (14)

Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ Exact algorithms for minimum routing cost trees ⋮ Network design problem with congestion effects: A case of bilevel programming ⋮ Solving the optimal network problem ⋮ On the minimum average distance spanning tree of the hypercube ⋮ Multiple Routing Strategies in a Labelled Network ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité ⋮ Heuristic methods and applications: A categorized survey ⋮ Approximation algorithms for the shortest total path length spanning tree problem ⋮ A GRASP and path relinking heuristic for rural road network development ⋮ A new optimal algorithm for backbone topology design in communications networks ⋮ Models for planning capacity expansion in local access telecommunication networks

This page was built for publication: Exact and approximate algorithms for optimal network design