{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T19:28:40Z","timestamp":1775158120075,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1023\/a:1014934612090","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T21:55:50Z","timestamp":1041112550000},"page":"15-32","source":"Crossref","is-referenced-by-count":34,"title":["Set-Up Coordination between Two Stages of a Supply Chain"],"prefix":"10.1007","volume":"107","author":[{"given":"A.","family":"Agnetis","sequence":"first","affiliation":[]},{"given":"P.","family":"Detti","sequence":"additional","affiliation":[]},{"given":"C.","family":"Meloni","sequence":"additional","affiliation":[]},{"given":"D.","family":"Pacciarelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"399505_CR1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(81)90048-X","volume":"13","author":"A.A. Bertossi","year":"1981","unstructured":"A.A. Bertossi, The edge Hamiltonian problem is NP-complete, Information Processing Letters 13 (1981) 157\u2013159.","journal-title":"Information Processing Letters"},{"issue":"4","key":"399505_CR2","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.G. Garey","year":"1976","unstructured":"M.G. Garey, D.S. Johnson and R.E. Tarjan, The planar Hamiltonian circuit problem is NP-complete, SIAM Journal on Computing 5(4) (1976) 704\u2013714.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"399505_CR3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F. Hadlock","year":"1975","unstructured":"F. Hadlock, Finding a maximum cut of a planar graph in polynomial time, SIAM Journal on Computing 4(3) (1975) 221\u2013225.","journal-title":"SIAM Journal on Computing"},{"key":"399505_CR4","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969)."},{"key":"399505_CR5","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","volume":"8","author":"F. Harary","year":"1965","unstructured":"F. Harary and C.St.J.A. Nash-Williams, On Eulerian and Hamiltonian graphs and line-graphs, Canadian Mathematics Bulletin 8 (1965) 701\u2013709.","journal-title":"Canadian Mathematics Bulletin"},{"key":"399505_CR6","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0020-0190(95)00163-8","volume":"56","author":"A. Raychaudhuri","year":"1995","unstructured":"A. Raychaudhuri, The total interval number of a tree and the Hamiltonian completion number of its line graph, Information Processing Letters 56 (1995) 299\u2013306.","journal-title":"Information Processing Letters"},{"key":"399505_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(96)00098-7","volume":"94","author":"D.J. Thomas","year":"1996","unstructured":"D.J. Thomas and P.M. Griffin, Coordinated supply chain management, European Journal of Operational Research 94 (1996) 1\u201315.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"399505_CR8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/jgt.3190120312","volume":"12","author":"H.J. Veldman","year":"1988","unstructured":"H.J. Veldman, A result on Hamiltonian line graphs involving restrictions on induced subgraphs, Journal of Graph Theory 12(3) (1988) 413\u2013420.","journal-title":"Journal of Graph Theory"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014934612090.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1014934612090\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014934612090.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:13:02Z","timestamp":1747577582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1014934612090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":8,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["399505"],"URL":"https:\/\/doi.org\/10.1023\/a:1014934612090","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}