Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation
- 1 May 2012
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 218 (3) , 829-837
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Modeling and solving the rooted distance-constrained minimum spanning tree problemComputers & Operations Research, 2008
- The network design problem with relaysEuropean Journal of Operational Research, 2007
- Strategic network design for multi-zone truckload shipmentsIIE Transactions, 2007
- Optical Network Design with Optical Constraints in IP/WDM NetworksIEICE Transactions on Communications, 2005
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner treesNetworks, 2003
- Multi-zone dispatching in truckload truckingTransportation Research Part E: Logistics and Transportation Review, 2001
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problemEuropean Journal of Operational Research, 2001
- Optimizing amplifier placements in a multiwavelength optical LAN/MAN: the unequally powered wavelengths caseIEEE/ACM Transactions on Networking, 1998
- Multicommodity flow models for spanning trees with hop constraintsEuropean Journal of Operational Research, 1996
- Using a Hop-Constrained Model to Generate Alternative Communication Network DesignINFORMS Journal on Computing, 1992