References
- Adenso-DíazBLagunaMFine-tuning of algorithms using fractional experimental designs and local searchOperations Research20065419911410.1287/opre.1050.0243
- AhujaRKMagnantiTLOrilJBTheory, Algorithms, and Application1993
- AlvarezAMGonzález-VelardeJLDe-AlbaKScatter search for network design problemAnnals of Operations Research2005138115917810.1007/s10479-005-2451-4
- BalakrishnanAMagnantiTLMirchandaniPNetwork designAnnotated Bibliographies in Combinatorial Optimization1997311329
- BazaraaMSJarvisJJSheralliHDLinear Programming and Network Flows2010
- BeasleyJEOR-library: Distributing test problems by electronic mailJournal of the Operational Research Society199041111069107210.1057/jors.1990.166
- BiratteriMTuning Metaheuristics: A Machine Learning Perspective2009
- CrainicTGService network design in freight transportationEuropean Journal of Operational Research2000122227228810.1016/S0377-2217(99)00233-7
- CrainicTGGendreauMCooperative parallel tabu search for capacitated network designJournal of Heuristics20028660162710.1023/A:1020325926188
- CrainicTGGendreauMA scatter search heuristic for the fixed-charge capacitated network design problem. MetaheuristicsOperations Research/Computer Science Interfaces Series200739254010.1007/978-0-387-71921-4_2
- CrainicTGDejaxPDelormeLModels for multimode multicommodity location problems with interdepot balancing requirementsAnnals of Operations Research198918127730210.1007/BF02097809
- CrainicTGGedreauMFarvoldenJMA simplex-based tabu search method for capacitated network designINFORMS Journal on Computing200012322323610.1287/ijoc.12.3.223.12638
- CrainicTGGendronBHernuGA slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network designJournal of Heuristics200410552554510.1023/B:HEUR.0000045323.83583.bd
- CrainicTGLiYToulouseMA first multilevel cooperative algorithm for capacitated multicommodity network designComputers & Operations Research20063392602262210.1016/j.cor.2005.07.015
- FischettiMLodiALocal branchingMathematical Programming2003981–3234710.1007/s10107-003-0395-5
- FrangioniAGendronB0–1 reformulations of the multicommodity capacitated network design problemDiscrete Applied Mathematics200815761229124110.1016/j.dam.2008.04.022
- GendronBCrainicTGRelaxations for Multicommodity Capacitated Network Design Problems1994
- GendronBCrainicTGFrangioniAMulticommodity capacitated network designTelecommunication Network Planning1998119
- GhamloucheICrainicTGGendreauMCycle-based neighbourhoods for fixed-charge capacitated multicommodity network designOperations Research200351465566710.1287/opre.51.4.655.16098
- GhamloucheICrainicTGGendreauMPath relinking, cycle-based neighbourhoods and capacitated multicommodity network designAnnals of Operations Research20041311–410913310.1023/B:ANOR.0000039515.90453.1d
- JayaramanVRossAA simulated annealing methodology to distribution network design and managementEuropean Journal of Operations Research2002144362964510.1016/S0377-2217(02)00153-4
- KatayamaNChenMKuboMA capacity scaling heuristic for the multicommodity capacitated network design problemJournal of Computational and Applied Mathematics200923219010110.1016/j.cam.2008.10.055
- KirkpatrickSGelattCVecchiMOptimization by simulated annealingScience1983220459867168010.1126/science.220.4598.671
- LübbeckeMEDesrosiersJSelected topics in column generationOperations Research20055361007102310.1287/opre.1050.0234
- MagnantiTLWongRTNetwork design and transportation planning: Models and algorithmsTransportation Science198418115510.1287/trsc.18.1.1
- MinouxMNetwork synthesis and optimum network design problems: Models, solution methods and applicationsNetworks198919331336010.1002/net.3230190305
- MinouxMDiscrete cost multicommodity network optimization problems and exact solution methodsAnnals of Operations Research20011061–4194610.1023/A:1014554606793
- MinouxMPolynomial approximation schemes and exact algorithms for optimum curve segmentation problemsDiscrete Applied Mathematics20041441–215817210.1016/j.dam.2004.05.003
- MontgomeryDDesign and Analysis of Experiments2005
- Ridge E (2007). Design of experiments for the tuning of optimization algorithms. PhD Thesis, Department of Computer Science, University of York, UK.
- Rodríguez-MartínISalazar-GonzálezJJA local branching heuristic for the capacitated fixed-charge network design problemComputers & Operations Research201037357558110.1016/j.cor.2008.09.003
- Stat-Ease (2010). User Guide to Design-Expert® Version 8 Software. Stat-Ease, Minneapolis, MN, USA.
- TalbiE-GMetaheuristics: From Design to Implementation2009
![Supercharge Your Next Research Paper: Research and write your next paper with Jenni AI.]({"type":"image" , "src" : "/sda/112446/MPU-L1EB.png"})