Design of capacitated multicommodity networks with multiple facilities

Operations Research

Volumn 50, Issue 2, 2002, Pages 333-344

  Agarwal, Yogesh K ^a  

^a INDIAN INSTITUTE OF MANAGEMENT   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

MULTICOMMODITY NETWORKS; SUBNETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 0036508156     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.50.2.333.423     Document Type: Article

References (26)

1. An algorithm for designing survivable networks
2. Valid inequalities and facets of the multicommodity network design problem based on 3- and 4-partitions
3. Network design using cut inequalities
4. Minimum cost capacity installation for multicommodity network flows
5. Capacitated network design - Polyhedral structure and computation
6. A cutting plane algorithm for multicommodity survivable network design problems
7. A hybrid dynamic programming branch and bound algorithm for the multiple choice knapsack problem
8. A greedy randomized adaptive search procedure for maximum independent set
9. LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
10. Backbone network design tools with economic tradeoffs
11. Tabu search - Part 1
12. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints
13. The optimum rented lines network problem
14. A Tabu search for the survivable fibre optic communication network design
15. Continuous models for capacity design of large packet switched telecommunications networks
16. Shortest paths, single origin-destination network design, and associated polyhedra
17. The convex hull of two core capacitated network design problems
18. Modeling and solving the two-facility capacitated network loading problem
19. Network synthesis and optimum network design problems: Models, solution methods and applications
20. Route selection in backbone data communications networks
21. Joint optimization of capacity and flow assignment in a packet-switched communication network
22. A polyhedral approach to multicommodity survivable network design