LS(Graph): a constraint-based local search for constraint optimization on trees and paths
- 12 July 2012
- journal article
- Published by Springer Nature in Constraints
- Vol. 17 (4) , 357-408
Abstract
No abstract availableKeywords
This publication has 51 references indexed in Scilit:
- Using Lagrangian dual information to generate degree constrained spanning treesDiscrete Applied Mathematics, 2006
- Maintaining information in fully dynamic trees with top treesACM Transactions on Algorithms, 2005
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problemOperations Research Letters, 2003
- On-line admission control and circuit routing for high performance computing and communication2002
- Approximation Algorithms for Disjoint Paths and Related Routing and Packing ProblemsMathematics of Operations Research, 2000
- Routing and wavelength assignment with power considerations in optical networksComputer Networks, 2000
- Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration studyIEEE/ACM Transactions on Networking, 2000
- A parallel tabu search heuristic for the vehicle routing problem with time windowsTransportation Research Part C: Emerging Technologies, 1997
- Design of wavelength-routed optical networks for packet switched trafficJournal of Lightwave Technology, 1997
- Network Flows: Theory, Algorithms, and Applications.Journal of the Operational Research Society, 1994