View Item 

Show simple item record

Locating depots for capacitated vehicle routing
dc.contributor.authorGørtz, Inge Li
dc.contributor.authorNagarajan, Viswanath
dc.date.accessioned2016-09-17T23:54:42Z
dc.date.available2017-12-01T21:54:11Zen
dc.date.issued2016-09
dc.identifier.citationGørtz, Inge Li ; Nagarajan, Viswanath (2016). "Locating depots for capacitated vehicle routing." Networks 68(2): 94-103.
dc.identifier.issn0028-3045
dc.identifier.issn1097-0037
dc.identifier.urihttps://hdl.handle.net/2027.42/133597
dc.publisherSpringer
dc.publisherWiley Periodicals, Inc.
dc.subject.otherapproximation algorithms
dc.subject.otherfacility location
dc.subject.othervehicle routing
dc.titleLocating depots for capacitated vehicle routing
dc.typeArticleen_US
dc.rights.robotsIndexNoFollow
dc.subject.hlbsecondlevelIndustrial and Operations Engineering
dc.subject.hlbsecondlevelManagement
dc.subject.hlbtoplevelEngineering
dc.subject.hlbtoplevelBusiness and Economics
dc.description.peerreviewedPeer Reviewed
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/133597/1/net21683_am.pdf
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/133597/2/net21683.pdf
dc.identifier.doi10.1002/net.21683
dc.identifier.sourceNetworks
dc.identifier.citedreferenceM.X. Goemans and D.P. Williamson, A general approximation technique for constrained forest problems, SIAM J Comput 24 ( 1995 ), 296 – 317.
dc.identifier.citedreferenceT. Carnes and D.B. Shmoys, “Primal‐dual schema and lagrangian relaxation for the k‐location‐routing problem,” Proceedings of the 14th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2011, Springer, Heidelberg, 2011, pp. 99 – 110.
dc.identifier.citedreferenceM. Charikar, S. Guha, E. Tardos, and D.B. Shmoys, A constant‐factor approximation algorithm for the k‐median problem, J Comput Syst Sci 65 ( 2002 ), 129 – 149.
dc.identifier.citedreferenceI.L. Gørtz and V. Nagarajan, Locating depots for capacitated vehicle routing, CoRR abs/1103.0985 ( 2011 ).
dc.identifier.citedreferenceA. Gupta and K. Tangwongsan, Simpler analyses of local search algorithms for facility location, CoRR abs/0809.2554 ( 2008 ).
dc.identifier.citedreferenceM. Haimovich and A.H.G.R. Kan, Bounds and heuristics for capacitated routing problems, Math Oper Res 10 ( 1985 ), 527 – 542.
dc.identifier.citedreferenceT. Harks, F.G. König, and J. Matuschke, Approximation algorithms for capacitated location routing, Transp Sci 47 ( 2013 ), 3 – 22.
dc.identifier.citedreferenceK. Jain, M. Mahdian, and A. Saberi, “A new greedy approach for facility location problems,” Proceedings of the 34th annual ACM symposium on theory of computing, ACM, New York, 2002, pp. 731 – 740.
dc.identifier.citedreferenceK. Jain and V.V. Vazirani, Approximation algorithms for metric facility location and k‐median problems using the primal‐dual schema and lagrangian relaxation, J ACM 48 ( 2001 ), 274 – 296.
dc.identifier.citedreferenceR. Krishnaswamy, A. Kumar, V. Nagarajan, Y. Sabharwal, and B. Saha, “The matroid median problem,” Proceedings of the annual ACM‐SIAM symposium on discrete algorithms (SODA), SIAM, 2011, pp. 1117 – 1130.
dc.identifier.citedreferenceG. Laporte, “ Location‐routing problems,” Vehicle routing: Methods and studies, B. Golden and A. Assad (Editors), North‐Holland, Amsterdam, 1988, pp. 163 – 198.
dc.identifier.citedreferenceG. Laporte, A survey of algorithms for location‐routing problems, Invest Oper 1 ( 1989 ), 93 – 123.
dc.identifier.citedreferenceC. Li and D. Simchi‐Levi, Worst‐case analysis of heuristics for multidepot capacitated vehicle routing problems, ORSA J Comput 2 ( 1990 ), 64 – 73.
dc.identifier.citedreferenceS. Li and O. Svensson, “ Approximating k‐median via pseudo‐approximation,” Proceedings of the 45th annual ACM symposium on theory of computing, ACM, New York, 2013, pp. 901 – 910.
dc.identifier.citedreferenceH. Min, V. Jayaraman, and R. Srivastava, Combined location‐routing problems: A synthesis and future research directions, Eur J Oper Res 108 ( 1998 ), 1 – 15.
dc.identifier.citedreferenceG. Nagy and S. Salhi, Location‐routing: Issues, models and methods, Eur J Oper Res 177 ( 2007 ), 649 – 672.
dc.identifier.citedreferenceA. Schrijver, Combinatorial optimization, Springer, Berlin, 2003.
dc.identifier.citedreferenceP. Toth and D. Vigo (Editors), “ The vehicle routing problem,” SIAM monographs on discrete mathematics and applications, Philadelphia, PA, USA, 2002.
dc.identifier.citedreferenceV.V. Vazirani, Approximation algorithms, Springer, Berlin, 2001.
dc.identifier.citedreferenceD.P. Williamson and D.B. Shmoys, The design of approximation algorithms, Cambridge University Press, New York, 2011.
dc.identifier.citedreferenceK. Altinkemer and B. Gavish, Heuristics for unequal weight delivery problems with a fixed error guarantee, Oper Res Lett 6 ( 1987 ), 149 – 158.
dc.identifier.citedreferenceK. Altinkemer and B. Gavish, Heuristics for delivery problems with constant error guarantees, Transp Res 24 ( 1990 ), 294 – 297.
dc.identifier.citedreferenceV. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit, Local search heuristics for k‐median and facility location problems, SIAM J Comput 33 ( 2004 ), 544 – 562.
dc.identifier.citedreferenceA. Balakrishnan, J. Ward, and R. Wong, Integrated facility location and vehicle routing models: Recent work and future prospects, Am J Math Manag Sci 7 ( 1987 ), 35 – 61.
dc.identifier.citedreferenceO. Berman, P. Jaillet, and D. Simchi‐Levi, “Location‐routing problems with uncertainty,” Facility location: A survey of applications and methods, Z. Drezner (Editor), Springer, New York, 1995, pp. 427 – 452.
dc.identifier.citedreferenceJ. Byrka, T. Pensyl, B. Rybicki, A. Srinivasan, and K. Trinh, An improved approximation for k ‐median, and positive correlation in budgeted optimization, CoRR abs/1406.2951 ( 2014 ).
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
net21683_am.pdf
Size:
471.0KB
Format:
PDF
View/Open
Name:
net21683.pdf
Size:
509.7KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.