{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:11:11Z","timestamp":1773317471194,"version":"3.50.1"},"reference-count":17,"publisher":"Wiley","issue":"7","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6158,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1989,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we discuss a computationally viable algorithm based on a set\u2010partitioning for\u2010mulation of the Vehicle Routing Problem (VRP). Implementation strategies based on theoretical as well as empirical results are developed. Some computational results are presented. It is shown that a set\u2010partitioning formulation to the VRP, although well known for a long time, deserves considerable research efforts beyond those we present here.<\/jats:p>","DOI":"10.1002\/net.3230190702","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T06:17:03Z","timestamp":1178950623000},"page":"731-749","source":"Crossref","is-referenced-by-count":81,"title":["A set\u2010partitioning\u2010based exact algorithm for the vehicle routing problem"],"prefix":"10.1002","volume":"19","author":[{"given":"Yogesh","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamlesh","family":"Mathur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harvey M.","family":"Salkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"Y.Agarwal A set partitioning approach to the vehicle routing problem. Ph.D. Dissertation. Case Western Reserve University (1985)."},{"key":"e_1_2_1_3_2","unstructured":"Y.Agarwal Set partitioning approach to vehicle routing. Presented at the TIMS\/ORSA Conference. Boston (1985)."},{"key":"e_1_2_1_4_2","unstructured":"Y.Agarwal The column generation subproblem of vehicle routing problem. Presented at the ORSA TIMS Conference Orlando (1983)."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.2.300"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589353"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110206"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140406"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110205"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1976.63"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.2.340"},{"key":"e_1_2_1_13_2","first-page":"207","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"Golden B. L.","year":"1985"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.5.1050"},{"key":"e_1_2_1_15_2","first-page":"147","article-title":"Exact algorithms for the vehicle routing problem","volume":"31","author":"Laporte G.","year":"1987","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.19.5.528"},{"key":"e_1_2_1_17_2","first-page":"439","volume-title":"Integer Programming","author":"Salkin H.","year":"1975"},{"key":"e_1_2_1_18_2","unstructured":"W. R.Stewart A computationally efficient heuristic for the traveling salesman problem.Proceedings of the 13th Annual Meetins of S.E. TIMS.(1977)75\u201385."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230190702","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230190702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T07:33:33Z","timestamp":1695800013000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230190702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":17,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["10.1002\/net.3230190702"],"URL":"https:\/\/doi.org\/10.1002\/net.3230190702","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}