{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:05:41Z","timestamp":1777597541390,"version":"3.51.4"},"reference-count":15,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1016\/0305-0548(94)00074-i","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"959-970","source":"Crossref","is-referenced-by-count":60,"title":["Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints"],"prefix":"10.1016","volume":"22","author":[{"given":"Luis","family":"Gouveia","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)00074-I_BIB1","first-page":"326","article-title":"Integer programming formulations and travelling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"J.A.C.M."},{"key":"10.1016\/0305-0548(94)00074-I_BIB2","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalization","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. tech. J."},{"key":"10.1016\/0305-0548(94)00074-I_BIB3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","article-title":"Topological design of centralized computer networks: Formulations and algorithms","volume":"12","author":"Gavish","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0305-0548(94)00074-I_BIB4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0305-0548(85)90032-2","article-title":"Edge exchanges in the degree-constrained minimum spanning tree problem","volume":"12","author":"Salvelsbergh","year":"1985","journal-title":"Comput. Ops. Res."},{"key":"10.1016\/0305-0548(94)00074-I_BIB5","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TCOM.1985.1096250","article-title":"Augmented lagrangean based algorithms for centralized network design","volume":"33","author":"Gavish","year":"1985","journal-title":"IEEE Trans. on Comm."},{"key":"10.1016\/0305-0548(94)00074-I_BIB6","series-title":"Telecommunications Systems Conf.","article-title":"A 2n-constraint formulation for the capacitated minimal spanning tree problem","author":"Gouveia","year":"1993"},{"key":"10.1016\/0305-0548(94)00074-I_BIB7","series-title":"Discrete Location Theory","year":"1990"},{"key":"10.1016\/0305-0548(94)00074-I_BIB8","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","article-title":"An algorithmic approach to network location problems II: The p-medians","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. appl Math."},{"key":"10.1016\/0305-0548(94)00074-I_BIB9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","article-title":"Improvements to the Miller-Tucker-Zemlin subtour elimination constraints","volume":"10","author":"Desrochers","year":"1991","journal-title":"Ops. Res. Lett."},{"key":"10.1016\/0305-0548(94)00074-I_BIB10","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0377-2217(85)90284-X","article-title":"Integer programming formulations of vehicle routing problems","volume":"20","author":"Kulkarni","year":"1985","journal-title":"Eur. J. Ops Res."},{"key":"10.1016\/0305-0548(94)00074-I_BIB11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0377-2217(89)90107-0","article-title":"Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave","volume":"38","author":"Laporte","year":"1989","journal-title":"Eur, J. Ops Res."},{"key":"10.1016\/0305-0548(94)00074-I_BIB12","series-title":"Mathematics of the Decision Sciences, Lectures in Applied Mathematics","first-page":"346","article-title":"Optimum Branchings","author":"Edmonds","year":"1968"},{"key":"10.1016\/0305-0548(94)00074-I_BIB13","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Mathl Progrm Study"},{"key":"10.1016\/0305-0548(94)00074-I_BIB14","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Mathl Progm"},{"key":"10.1016\/0305-0548(94)00074-I_BIB15","unstructured":"L. Gouveia, Multicommodity flows models and spanning trees with hop constraints Eur. J. Ops Res. to be published."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489400074I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489400074I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:58:43Z","timestamp":1556672323000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489400074I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":15,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["030505489400074I"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)00074-i","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}