Pages that link to "Item:Q4182675"
From MaRDI portal
The following pages link to Exact and approximate algorithms for optimal network design (Q4182675):
Displaying 12 items.
- Models for planning capacity expansion in local access telecommunication networks (Q806810) (← links)
- On the minimum average distance spanning tree of the hypercube (Q934836) (← links)
- Solving the optimal network problem (Q1135216) (← links)
- A new optimal algorithm for backbone topology design in communications networks (Q1310214) (← links)
- Approximation algorithms for the shortest total path length spanning tree problem (Q1582085) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
- Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- A GRASP and path relinking heuristic for rural road network development (Q2573003) (← links)
- Multiple Routing Strategies in a Labelled Network (Q2765602) (← links)
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
