A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem
Year of publication: |
2003
|
---|---|
Authors: | Ahuja, Ravindra K. ; Orlin, James B. ; Sharma, Dushyant |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 31.2003, 3, p. 185-194
|
Saved in:
Saved in favorites
Similar items by person
-
Solving Real-Life Locomotive-Scheduling Problems
Ahuja, Ravindra K., (2005)
-
New neighborhood search structures for the capacitated minimum spanning tree problem
Ahuja, Ravindra K., (1998)
-
A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model
Ahuja, Ravindra K., (2007)
- More ...