References
- Agarwal R, Ahuja RK, Laporte G and Shen ZJ (2004). A composite very large-scale neighborhood search algorithm for the vehicle routing problem. In: Leung, JY-T (ed). Handbook of Scheduling: Algorithms, Models and Performance Analysis, Chapter 49. Chapman & Hall CRC, New York, pp 49-01–49-23.
- AhujaRKCunhaCBVery large-scale neighborhood search for the k-constraint multiple knapsack problemJ Heuristics20051146548110.1007/s10732-005-2634-9
- AhujaRKErgunOOrlinJBPunnenAA survey of very large scale neighborhood search techniquesDiscrete Appl Math2002237510210.1016/S0166-218X(01)00338-9
- AhujaRKErgunOOrlinJBPunnenAVery large scale neighborhood search: Theory, algorithms, and applicationsHandbook on Approximation Algorithms and Metaheuristics2007
- AhujaRKLiuJOrlinJBGoodsteinJMukherjeeAA neighborhood search algorithm for the combined through and fleet assignment model with time windowsNetworks20044416017110.1002/net.20026
- AhujaRKMagnantiTLOrlinJBNetwork Flows: Theory, Algorithms and Applications1992
- AhujaRKOrlinJBSharmaDA composite very large scale neighborhood structure for the capacitated minimum spanning tree problemOpl Res Lett20033118519410.1016/S0167-6377(02)00236-5
- AhujaRKA multi-exchange heuristic for the single source capacitated facility locationMngt Sci20045074976010.1287/mnsc.1030.0193
- CarpanetoGMartelloSTothPAlgorithms and codes for the assignment problemAnn Oper Res19881319322310.1007/BF02288323
- CPLEX, ILOG CPLEX 9.0 User's Manual (2003)..
- DeMaioARovedaCAn all zero-one algorithm for a certain class of transportation problemsOpns Res1971191406141810.1287/opre.19.6.1406
- DreznerZHamacherHWFacility Location: Applications and Theory2004
- Ergun O, Orlin JB and Steele-Feldman A (2002). Creating very large neighborhoods out of smaller ones by compounding moves: A study on the vehicle routing problem. MIT Sloan Working Paper No. 4393-02.
- FouldsLRWilsonJMA variation of the generalized assignment problem arising in the New Zealand dairy industryAnn Oper Res19976910511410.1023/A:1018968625626
- GareyMRJohnsonDSComputers and Intractability: A Guide to the Theory of NP-Completeness1979
- Hansen P and Mladenovic N (2003). A tutorial on variable neighborhood search. Les Cahiers du GERAD, G-2003-46, Université de Montréal, HEC, Canada.
- HoffmanKPadbergMSolving airline crew-scheduling problems by branch-and-cutMngt Sci199339667682
- KernighanBLinSAn efficient heuristic procedure for partitioning graphsAT & T Tech J197049291307
- LawlerECombinatorial Optimization: Networks and Matroids1976
- MartelloSTothPKnapsack Problems: Algorithms and Computer Codes1990
- OrlinJBPunnenAPSchulzASApproximate local search in combinatorial optimizationSIAM J Comput2004331201121410.1137/S0097539703431007
- OrlinJBSharmaDExtended neighborhood: Definition and characterizationMath Program200410153755910.1007/s10107-003-0497-0
- PunnenAPThe traveling salesman problem: New polynomial algorithms and domination analysisJ Inform Optim200122191206
- PinedoMScheduling: Theory, Algorithm and System1995
- SrinivasanVThompsonGLAn algorithm for assigning uses to sources in a special class of transportation problemsOpns Res19732128429510.1287/opre.21.1.284
- Thompson PM and Orlin JM (1989). The theory of cyclic transfers. MIT Operations Research Center Report 200-89.
- ThompsonPMPsaraftisHNCyclic transfer algorithms for multivehicle routing and scheduling problemsOpns Res19934193594610.1287/opre.41.5.935