Exact and approximate algorithms for optimal network design
From MaRDI portal
Algorithms for Optimal Network DesignFinding a Connected SubgraphNp- Complete ProblemsSum of the Weighted Shortest Distances
Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Programming involving graphs or networks (90C35) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Applications of graph theory to circuits and networks (94C15)
Cited in
(14)- Solving the optimal network problem
- A new optimal algorithm for backbone topology design in communications networks
- Approximation algorithms for the shortest total path length spanning tree problem
- Heuristic methods and applications: A categorized survey
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- On the severity of Braess's paradox: designing networks for selfish users is hard
- A GRASP and path relinking heuristic for rural road network development
- Multiple routing strategies in a labelled network
- Network design problem with congestion effects: A case of bilevel programming
- Exact algorithms for minimum routing cost trees
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- Models for planning capacity expansion in local access telecommunication networks
- On the minimum average distance spanning tree of the hypercube
This page was built for publication: Exact and approximate algorithms for optimal network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4182675)
