{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:06:14Z","timestamp":1751367974298},"reference-count":21,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5356,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1002\/1097-0037(200103)37:2<74::aid-net2>3.0.co;2-e","type":"journal-article","created":{"date-parts":[[2004,10,27]],"date-time":"2004-10-27T13:08:54Z","timestamp":1098882534000},"page":"74-83","source":"Crossref","is-referenced-by-count":30,"title":["A branch and cut method for the degree-constrained minimum spanning tree problem"],"prefix":"10.1002","volume":"37","author":[{"given":"L.","family":"Caccetta","sequence":"first","affiliation":[]},{"given":"S.P.","family":"Hill","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2001]]},"reference":[{"key":"BIB1","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/0377-2217(94)00332-7","volume":"91","author":"Achuthan","year":"1995","journal-title":"Eur J Oper Res"},{"key":"BIB2","author":"Achuthan","unstructured":"and An improved branch and cut algorithm for the capacitated vehicle routing problem, submitted for publication."},{"key":"BIB3","first-page":"6450","author":"Applegate","year":"1998","journal-title":"Doc Math (J Deutsch Mathe-Vereinigung) Int Congr Math"},{"key":"BIB4","author":"Augerat","year":"1995","unstructured":"and Computational results with a branch and cut code for the capacitated vehicle routing problem, Research Report 949-M, Universite Joseph Fourier, Grenoble, France, (1995)."},{"key":"BIB5","first-page":"29","volume-title":"Recent studies in graph theory","author":"Caccetta","year":"1989","unstructured":"?Graph theory in network design and analysis?, Recent studies in graph theory, (Editor), Vishwa International, India, (1989), 29-63."},{"key":"BIB6","author":"Caccetta","unstructured":"and Heuristics for the degree restricted spanning tree problem, submitted for publication."},{"key":"BIB7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"Christofides","year":"1981","journal-title":"Math Program"},{"key":"BIB8","author":"CPLEX Optimization Inc.","year":"1993","unstructured":"CPLEX Optimization Inc., Using the CPLEX Callable Library and CPLEX Mixed Integer Library, 930 Tahoe Blvd # 802-297, Incline Village, NV 89451, 1993."},{"key":"BIB9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Num Math"},{"key":"BIB10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"Gabow","year":"1986","journal-title":"Combinatorica"},{"key":"BIB11","volume-title":"Computers and interactibility, A guide to the theory of NP-completeness","author":"Garey","year":"1979","unstructured":"and Computers and interactibility, A guide to the theory of NP-completeness Freeman, San Francisco, 1979."},{"key":"BIB12","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"Gavish","year":"1982","journal-title":"Networks"},{"key":"BIB13","author":"Hill","year":"1995","unstructured":"Branch and cut methods for the symmetric capacitated vehicle routing, PhD Thesis, Curtin University of Technology, Perth, Western Australia, 1995."},{"key":"BIB14","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc Am Math Soc"},{"key":"BIB15","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","volume":"33","author":"Laporte","year":"1985","journal-title":"Oper Res"},{"key":"BIB16","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0305-0548(80)90022-2","volume":"7","author":"Narula","year":"1980","journal-title":"Comput Oper Res"},{"key":"BIB17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Rev"},{"key":"BIB18","first-page":"1389","volume":"36","author":"Prim","year":"1957","journal-title":"BSTJ"},{"key":"BIB19","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0305-0548(85)90032-2","volume":"12","author":"Savelsbergh","year":"1985","journal-title":"Comput Oper Res"},{"key":"BIB20","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0377-2217(89)90169-0","volume":"39","author":"Volgenant","year":"1989","journal-title":"Eur J Oper Res"},{"key":"BIB21","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0377-2217(83)90161-3","volume":"12","author":"Volgenant","year":"1983","journal-title":"Eur J Oper Res"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1097-0037(200103)37:2%3C74::AID-NET2%3E3.0.CO;2-E","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1097-0037(200103)37:2%3C74::AID-NET2%3E3.0.CO;2-E","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T10:58:15Z","timestamp":1625137095000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1097-0037(200103)37:2<74::AID-NET2>3.0.CO;2-E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,3]]}},"URL":"https:\/\/doi.org\/10.1002\/1097-0037(200103)37:2<74::aid-net2>3.0.co;2-e","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]}}}