乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T13:27:32Z","timestamp":1707312452346},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["PTDC\/MAT-NAN\/2196\/2014","UID\/MAT\/04561\/2013"],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005765","name":"Universidade de Lisboa","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005765","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1016\/j.ejor.2018.12.041","type":"journal-article","created":{"date-parts":[[2018,12,29]],"date-time":"2018-12-29T21:38:37Z","timestamp":1546119517000},"page":"40-64","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm"],"prefix":"10.1016","volume":"276","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-0634-144X","authenticated-orcid":false,"given":"Tolga","family":"Bekta\u015f","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-4393-1617","authenticated-orcid":false,"given":"Lu\u00eds","family":"Gouveia","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Santos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ejor.2018.12.041_bib0001","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02085634","article-title":"A branch-and-cut algorithm for vehicle routing problems","volume":"50","author":"Araque G.","year":"1994","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2018.12.041_bib0002","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ejor.2011.07.020","article-title":"Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing","volume":"216","author":"Bekta\u015f","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2018.12.041_bib0003","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1002\/net.21760","article-title":"New path elimination constraints for multi-depot routing problems","volume":"70","author":"Bekta\u015f","year":"2017","journal-title":"Networks"},{"issue":"6","key":"10.1016\/j.ejor.2018.12.041_bib0004","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1016\/j.cor.2010.09.019","article-title":"A branch-and-cut method for the capacitated location-routing problem","volume":"38","author":"Belenguer","year":"2011","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2018.12.041_bib0005","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s10479-011-1024-y","article-title":"Multi-depot multiple TSP: a polyhedral study and computational results","volume":"207","author":"Benavent","year":"2013","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2018.12.041_bib0006","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0377-2217(90)90092-P","article-title":"The Hamiltonian p-median problem","volume":"47","author":"Branco","year":"1990","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2018.12.041_bib0007","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.ipl.2003.11.005","article-title":"Cliques, holes and the vertex coloring polytope","volume":"89","author":"Camp\u00ealo","year":"2004","journal-title":"Information Processing Letters"},{"issue":"4","key":"10.1016\/j.ejor.2018.12.041_bib0008","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solution of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Journal of the Operations Research Society of America"},{"issue":"2","key":"10.1016\/j.ejor.2018.12.041_bib0009","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/j.ejor.2016.02.012","article-title":"Exact and heuristic algorithms for the Hamiltonian p-median problem","volume":"253","author":"Erdo\u011fan","year":"2016","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2018.12.041_bib0010","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.45.3.378","article-title":"A branch-and-cut algorithm for the symmetric generalized traveling salesman problem","volume":"45","author":"Fischetti","year":"1997","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2018.12.041_bib0011","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for vehicle routing","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.ejor.2018.12.041_bib0012","doi-asserted-by":"crossref","first-page":"42","DOI":"10.37236\/1520","article-title":"The Hamiltonian p-median problem","volume":"7","author":"Glaab","year":"2000","journal-title":"The Electronic Journal of Combinatorics"},{"issue":"4","key":"10.1016\/j.ejor.2018.12.041_bib0013","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1002\/net.21550","article-title":"A comparison of several models for the Hamiltonian p-median problem","volume":"63","author":"Gollowitzer","year":"2014","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2018.12.041_bib0014","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.endm.2013.05.095","article-title":"A polyhedral study of the Hamiltonian p-median problem","volume":"41","author":"Hupp","year":"2013","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10.1016\/j.ejor.2018.12.041_bib0015","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF02023807","article-title":"An exact algorithm for solving a capacitated location-routing problem","volume":"6","author":"Laporte","year":"1986","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2018.12.041_bib0016","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0377-2217(83)90182-0","article-title":"Hamiltonian location problems","volume":"12","author":"Laporte","year":"1983","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2018.12.041_bib0017","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/ijoc.2016.0704","article-title":"A branch-and-price algorithm for solving the Hamiltonian p-median problem","volume":"28","author":"Marzouk","year":"2016","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"10.1016\/j.ejor.2018.12.041_bib0018","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulation of traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"8","key":"10.1016\/j.ejor.2018.12.041_bib0019","first-page":"355","article-title":"A new formulation of the Hamiltonian p-median problem","volume":"1","author":"Zohrehbandian","year":"2007","journal-title":"Applied Mathematical Sciences"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221718311159?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221718311159?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T11:09:06Z","timestamp":1656587346000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221718311159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["S0377221718311159"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2018.12.041","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2018.12.041","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}