References
- Moreno Pérez J, Moreno-Vega M and Rodríguez Martín I (2002). Variable neighbourhood tabu search and its application to the median cycle problem. European Journal of Operational Research, 2004, to appear.
- Labbé M, Laporte G, Rodríguez Martín I and Salazar González JJ (2001). The Ring star problem: polyhedral analysis and exact algorithm. Unpublished manuscript.
- Labbé M, Laporte G, Rodríguez Martín I and Salazar González JJ (2001). The median cycle problem. Unpublished manuscript.
- GourdinELabbéMYamanHTelecommunication and locationFacility Location: Applications and Theory2002275305
- KlincewiczJHub location in backbone/tributary network design: a reviewLocation Sci1998630733510.1016/S0966-8349(98)00042-4
- LabbéMLaporteGMaximizing user convenience and postal service efficiency in post box locationBelgian J Opns Res Stat Comput Sci1986262135
- BauerPThe circuit polytope: facetsMath Opns Res19972211014510.1287/moor.22.1.110
- LaporteGLocation-routing problemsVehicle Routing: Methods and Studies1988163197
- VolgenantTJonkerROn some generalizations of the traveling salesman problemJ Opl Res Soc1987381073107910.1057/jors.1987.177
- GendreauMLaporteGSemetFThe selective traveling salesman problemNetworks19983226327310.1002/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q
- FischettiMSalazar GonzálezJJTothPSolving the orienteering problem through branch-and-cutINFORMS J Comput19981013314810.1287/ijoc.10.2.133
- BalasEThe prize collecting traveling salesman problemNetworks19891962163610.1002/net.3230190602
- GendreauMLaporteGSemetFThe covering tour problemOpns Res19974556857610.1287/opre.45.4.568
- LabbéMLaporteGRodríguez MartínIPath, tree and cycle locationFleet Management and Logistics1998187204
- Feremans C, Labbé M and Laporte G (2003). Generalized network design problems. Eur J Opl Res, to appear.
- RenaudJBoctorFLaporteGFast composite heuristic for the symmetric traveling salesman problemORSA J Comput1996313414310.1287/ijoc.8.2.134
- LinSKernighanBWAn effective heuristic algorithm for the traveling salesman problemOpns Res19732049851610.1287/opre.21.2.498
- HelsgaumKEffective implementation of the Lin–Kerninghan traveling salesman heuristicEur J Opl Res200012610613010.1016/S0377-2217(99)00284-2
- BeanJGenetic algorithms and random keys for sequencing and optimizationORSA J Comput1994615416010.1287/ijoc.6.2.154
- ReineltGTSPLIB—a traveling salesman problem libraryORSA J Comput1991337638410.1287/ijoc.3.4.376