{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:10:53Z","timestamp":1726513853286},"reference-count":7,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7223,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1987,1]]},"abstract":"Abstract<\/jats:title>Two bipartite matching problems arising in Vehicle Scheduling are considered: the capacitated matching and the multicommodity matching. For the former, given a reasonable cost structure, we can exhibit a polynomial time algorithm, while the general case is conjectured to be NP\u2010hard. The latter problem is shown to be NP\u2010hard. A heuristic algorithm based on Lagrangean relaxation for the capacitated version of the multicommodity matching is also presented together with experimental results.<\/jats:p>","DOI":"10.1002\/net.3230170303","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T22:22:08Z","timestamp":1178922128000},"page":"271-281","source":"Crossref","is-referenced-by-count":174,"title":["On some matching problems arising in vehicle scheduling models"],"prefix":"10.1002","volume":"17","author":[{"given":"A. A.","family":"Bertossi","sequence":"first","affiliation":[]},{"given":"P.","family":"Carraresi","sequence":"additional","affiliation":[]},{"given":"G.","family":"Gallo","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110204"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90068-7"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(82)90020-0"},{"key":"e_1_2_1_5_2","volume-title":"Computers and intractability: a guide to the theory of NP\u2010Completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110211"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/322307.322309"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230170303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230170303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T16:29:37Z","timestamp":1697905777000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230170303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/net.3230170303"],"URL":"https:\/\/doi.org\/10.1002\/net.3230170303","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}