References
- Aksen D, Özyurt Z and Aras N (2006). The open vehicle routing problem with driver nodes and time deadlines. J Opl Res Soc, AOP 9/8/06 doi: 10.1057/palgrave.jors.2602249.
- Augerat P (1995). Approche Polyèdrale du Problème de Tournées de Véhicules. PhD thesis, Institut National Polytechnique de Grenoble.
- BodinLDGoldenBLAssadAABallMORouting and scheduling of vehicles and crews: The state of the artComput Opns Res1983106321110.1016/0305-0548(83)90030-8
- BrandãoJA tabu search algorithm for the open vehicle routing problemEur J Opl Res200415755256410.1016/S0377-2217(03)00238-8
- ChristofidesNEilonSAn algorithm for the vehicle-dispatching problemOpns Res Quart19692030931810.1057/jors.1969.75
- EdmondsJMaximum matching and a polyhedron with 0–1 verticesJ Res Nat Bur Standards196569B12513010.6028/jres.069B.013
- FischettiMTothPVigoDA branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphsOpns Res19944284685910.1287/opre.42.5.846
- FordLFulkersonDFlows in Networks1962
- FuZEgleseRLiLYOA new tabu search heuristic for the open vehicle routing problemJ Opl Res Soc20055626727410.1057/palgrave.jors.2601817
- FuZEgleseRLiLYOCorrigendum to ‘A new tabu search heuristic for the open vehicle routing problem'J Opl Res Soc200657101810.1057/palgrave.jors.2602181
- FukasawaRRobust branch-and-cut-and-price for the capacitated vehicle routing problemMath Program200610649151110.1007/s10107-005-0644-x
- GoldbergAVTarjanREA new approach to the maximum flow problemJ ACM19883592194010.1145/48014.61051
- LaporteGNobertYDesrochersMOptimal routing under capacity and distance restrictionsOpns Res1985331050107310.1287/opre.33.5.1050
- LetchfordANEgleseRWLysgaardJMultistars, partial multistars and the capacitated vehicle routing problemMath Program200294214010.1007/s10107-002-0336-8
- Li F, Golden B and Wasil E (2006). The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Comput Opns Res, doi: 10.1016/j.cor.2005.11.018.
- Lysgaard J (2003). CVRPSEP: A Package of Separation Routines for the Capacitated Vehicle Routing Problem. Working Paper 03-04, Department of Management Science and Logistics, Aarhus School of Business. www.asb.dk/~lys/.
- LysgaardJLetchfordANEgleseRWA new branch-and-cut algorithm for the capacitated vehicle routing problemMath Program200410042344510.1007/s10107-003-0481-8
- NaddefDRinaldiGBranch-and-cut algorithms for the capacitated VRPThe Vehicle Routing Problem. Chapter 32002
- NobertYPicardJ-CAn optimal algorithm for the mixed Chinese postman problemNetworks1996279510810.1002/(SICI)1097-0037(199603)27:2<97::AID-NET1>3.0.CO;2-8
- PadbergMWRaoMROdd minimum cut-sets and b-matchingsMath Opns Res19827678010.1287/moor.7.1.67
- Pisinger D and Ropke S (2006). A general heuristic for vehicle routing problems. Comput Opns Res, doi: 10.1016/j.cor.2005.09.012.
- ReineltGTSPLIB—A traveling salesman problem libraryORSA J Comput1991337638410.1287/ijoc.3.4.376
- Repoussis PP, Tarantilis CD and Ioannou G (2006). The open vehicle routing problem with time windows. J Opl Res Soc, AOP 1/2/06 doi: 10.1057/palgrave.jors.2602143.
- SariklisDPowellSA heuristic method for the open vehicle routing problemJ Opl Res Soc20005156457310.1057/palgrave.jors.2600924
- SchrageLFormulation and structure of more complex/realistic routing and scheduling problemsNetworks19811122923210.1002/net.3230110212
- TarantilisCDDiakoulakiDKiranoudisCTCombination of geographical information system and efficient routing algorithms for real life distribution operationsEur J Opl Res200415243745310.1016/S0377-2217(03)00035-3
- TarantilisCDIoannouGKiranoudisCTPrastacosGPSolving the open vehicle routeing problem via a single parameter metaheuristic algorithmJ Opl Res Soc20055658859610.1057/palgrave.jors.2601848
- Toth P and Vigo D (eds). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications: Philadelphia PA.