References
- AhaDWKiblerDAlbertMKInstance-based learning algorithmsMach Learn199163766
- AhujaRKOrlinJBSharmaDA composite very large-scale neighborhood structure for the capacitated minimum spanning tree problemOpns Res Lett20033118519410.1016/S0167-6377(02)00236-5
- AltınelİKÖncanTA new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problemJ Opl Res Soc20055695496110.1057/palgrave.jors.2601916
- AmbergADomschkeWVossSCapacitated minimum spanning trees: Algorithms using intelligent searchComb Optim: Theory Pract19961939
- BardJFHuangLJailletPDrorMA decomposition approach to the inventory routing problem with satellite facilitiesTransportat Sci19983218920310.1287/trsc.32.2.189
- Battarra M (2010). Exact and heuristic algorithms for routing problems. PhD thesis, Università di Bologna.
- BattarraMGoldenBLVigoDTuning a parametric Clarke-Wright heuristic via a genetic algorithmJ Opl Res Soc2008591568157210.1057/palgrave.jors.2602488
- BazaraaMSSheraliHDShettyCMNonlinear Programming: Theory and Algorithms2005
- ChandranBGoldenBLWasilEA computational study of three demon algorithm variants for solving the traveling salesman problemComputational Modeling and Problem Solving in the Networked World2003155175
- ClarkeGWrightJWScheduling of vehicles from a central depot to a number of delivery pointsOpns Res19641256858110.1287/opre.12.4.568
- CordeauJ-FGendreauMLaporteGPotvinJ-YSemetFA guide to vehicle routing heuristicsJ Opl Res Soc20025351210.1057/palgrave.jors.2601319
- CortesCVapnikVSupport-vector networksMach Learn199520273297
- DaiHKFujinoSOn designing constrained local access networksProceedings of the 2000 International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN00)2000167176
- Daskin MS (2002). Randomized saving algorithms. Private Communication.
- EsauLRWilliamsKCOn teleprocessing system design, part II: A method for approximating the optimal networkIBM Syst J1966514214710.1147/sj.53.0142
- GavishBTopological design of telecommunication networks-local access design methodsAnn Opns Res199133177110.1007/BF02061657
- GoldenBLPepperJVossenTUsing genetic algorithms for setting parameter values in heuristic searchIntelligent Engineering System through Artificial Neural Networks1998239245
- HookeRJeevesTADirect search solution of numerical and statistical problemsJ Assoc Comput Mach1961821222910.1145/321062.321069
- MorganJSonquistJProblems in the analysis of survey data, and a proposalJ Am Stat Assoc19635841543410.1080/01621459.1963.10500855
- NelderJAMeadRA simplex method for function minimizationComput J1964730831310.1093/comjnl/7.4.308
- ÖncanTAltınelIKParametric enhancements of the Esau-Williams heuristic for the capacitated minimum spanning tree problemJ Opl Res Soc20096025926710.1057/palgrave.jors.2602548
- PapadimitriouCHThe complexity of the capacitated tree problemNetworks1978821723010.1002/net.3230080306
- ParkM-WKimY-DA systematic procedure for setting parameters in simulated annealing algorithmsComput Opns Res19982420721710.1016/S0305-0548(97)00054-3
- ParsonRJohnsonMA case study in experimental design applied to genetic algorithms with applications to DNA sequence assemblyAm J Math Manage Sci199717369396
- PattersonRPirkulHHeuristic procedure neural networks for the CMST problemComput Opns Res2000271171120010.1016/S0305-0548(99)00145-8
- PattersonRPirkulHRollandEA memory adaptive reasoning technique for solving the capacitated minimum spanning tree problemJ Heuristics1999515918010.1023/A:1009629727566
- PepperJGoldenBWasilESolving the traveling salesman problem with annealing-based heuristics: a computational studyIEEE Trans Syst Man Cybern A200232727710.1109/3468.995530
- QuinlanJRC4.5: Programs for Machine Learning1993
- RobertsonWGoldenBLRungerGCWasilENeural network models for initial public offeringsNeurocomputing19981816518210.1016/S0925-2312(97)00077-5
- RumelhartDEHintonGEWilliamsRJLearning internal representations by error propagationParallel Distrib Process19861318362
- UchoaEFukasawaRLysgaardJPessoaAPoggi da AragãoMAn-dradeDRobust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulationMath Program, Ser. A200811244347210.1007/s10107-006-0043-y
- Van Breedam A (1996). An analysis of the effect of local improvement operators in genetic algorithms and simulated annealing for the vehicle routing problem. Technical report, RUCA Working Paper 96/14, Faculty of Applied Economics, University of Antwerp, Belgium.