References
- AbeledoHFukasawaRPessoaAUchoaEThe time dependent traveling salesman problem: Polyhedra and algorithmMathematical Programming Computation201351275510.1007/s12532-012-0047-y
- AfratiFCosmadakisSPapadimitriouCPapageorgiouGPapakostantinouNThe complexity of the travelling repairman problemRAIRO Informatique Theorique et Applications19862017987
- Angel-BelloFAlvarezAGarcíaITwo improved formulations for the minimum latency problemApplied Mathematical Modelling20133742257226610.1016/j.apm.2012.05.026
- Augerat P, Belenguer JM, Benavent E, Corberán A, Naddef D and Rinaldi G (1995). Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report, IMAG. Joseph Fourier University: Grenoble, France.
- Ausiello G, Leonardi S and Marchetti-Spaccamela A (2000). On salesmen, repairmen, spiders and other traveling agents. In: Proceedings of the Italian Conference on Algorithms and Complexity. Springer Berlin Heidelberg: Rome, Italy, pp 1–16.
- AverbakhIBermanOSales-delivery man problems on treelike networksNetworks1995252455810.1002/net.3230250204
- Blum A, Chalassani P, Coppersmith D, Pulleyblank B, Raghavan P and Sudan M (1994). The minimum latency problem. In: Proceedings of 26th Symposium on Theory of Computing (1994). ACM: Montreal, Quebec, Canada, pp 163–171.
- ChristofidesNEilonSAn algorithm for the vehicle dispatching problemsOperational Research Quarterly196920330931810.1057/jors.1969.75
- ChristofidesNMingozziATothPThe vehicle routing problemCombinatorial Optimization1979
- CulbersonJLuoFExploring the k-colorable landscape with iterated greedyCliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge1996245284
- EzzineIElloumiSPolynomial formulation and heuristic based approach for the k-travelling repairman problemInternational Journal of Mathematics in Operational Research20124550351410.1504/IJMOR.2012.048928
- Ezzine I, Semet F and Chabchoub H (2010). New formulations for the traveling repairman problem. In: Proceedings of the 8th International Conference of Modeling and Simulation MOSIM10 (2010). Hammamet – Tunisia.
- Fackcharoenphol J, Harrelson C and Rao S (2003). The k-traveling repairman problem. In: Proceedings of 14th symposium on Discrete Algorithms (SODA) (2003). ACM: New York, pp 655–644.
- FakcharoenpholJHarrelsonCRaoSThe k-traveling repairmen problemACM Transactions on Algorithms2007341610.1145/1290672.1290677
- FischettiMLaporteGMartelloSThe delivery man problem and cumulative matroidsOperations Research19934161055106410.1287/opre.41.6.1055
- Gavish B and Graves SC (1978). The travelling salesman problem and related problems. Working Paper. Operations Research Center, Massachusetts Institute of Technology.
- GoemansMKleinbergJAn improved approximation ratio for the minimum latency problemMathematical Programming1998821111124
- JacobsLBruscoMA local-search heuristic for large set-covering problemsNaval Research Logistics19954271129114010.1002/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M
- JothiRRaghavachariBApproximating the k-traveling repairman problem with repairtimesJournal of Discrete Algorithms20075229330310.1016/j.jda.2006.03.023
- KaraIKaraBYYetişMKCumulative vehicle routing problemsVehicle Routing Problem20088598
- KeLFengZA two-phase metaheuristic for the cumulative capacitated vehicle routing problemComputers & Operations Research201340263363810.1016/j.cor.2012.08.020
- LuoZQinHLimABranch-and-price-and-cut for the multiple traveling repairman problem with distance constraintsEuropean Journal of Operational Research20142341496010.1016/j.ejor.2013.09.014
- LysgaardJWøhlkSA branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problemEuropean Journal of Operational Research2014236380081010.1016/j.ejor.2013.08.032
- MartíRMoreno-VegaJMDuarteAAdvanced multi-start methodsHandbook of Metaheuristics, International Series in Operations Research & Management Science 1462010265281
- Méndez-DíazIZabalaPLucenaAA new formulation for the traveling deliveryman problemDiscrete Applied Mathematics2008156173223323710.1016/j.dam.2008.05.009
- MladenovicNUroševicDHanafiSVariable neighborhood search for the travelling deliveryman problem4OR: A Quarterly Journal of Operations Research2012111577310.1007/s10288-012-0212-1
- NgueveuSUPrinsCWolfler CalvoRAn effective memetic algorithm for the cumulative capacitated vehicle routing problemComputers & Operations Research201037111877188510.1016/j.cor.2009.06.014
- PotvinJYRousseauJMA parallel route building algorithm for the vehicle routing and scheduling problem with time windowsEuropean Journal of Operational Research199366333134010.1016/0377-2217(93)90221-8
- ReineltGTSPLIB—A traveling salesman problem libraryORSA Journal on Computing19913437638410.1287/ijoc.3.4.376
- RibeiroGMLaporteGAn adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problemComputers & Operations Research201239372873510.1016/j.cor.2011.05.005
- SahniSGonzalezTP-complete approximation problemsJournal of the ACM197623355556510.1145/321958.321975
- Salehipour A, Sörensen K, Goos P and Bräysy O (2008). An efficient grasp+vnd metaheuristic for the traveling repairman problem. Technical Report, University of Antwerp, Faculty of Applied Economics.
- SalehipourASörensenKGoosPBräysyOAnefficient grasp+vnd and grasp+vns metaheuristics for thetraveling repairman problem4OR: A Quarterly Journal of Operations Research20119218920910.1007/s10288-011-0153-0
- SilvaMSubramanianAVidalTOchiLA simple and effective metaheuristic for the minimum latency problemEuropean Journal of Operational Research2012221351352010.1016/j.ejor.2012.03.044
- Simchi-LeviDBermanOMinimizing the total flow time of n jobs on a networkIIE Transactions199123323624410.1080/07408179108963858
- Sitters R (2002). The minimum latency problem is NP-hard for weighted trees. In: 9th Integer Programming and Combinatorial Optimization Conference (2002). Springer Berlin Heidelberg: Cambridge, MA.
- WuBPolynomial time algorithms for some minimum latency problemsInformation Processing Letters200075522522910.1016/S0020-0190(00)00102-2