{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:21:49Z","timestamp":1761895309653},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T00:00:00Z","timestamp":1312848000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["TOP"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s11750-011-0212-x","type":"journal-article","created":{"date-parts":[[2011,8,8]],"date-time":"2011-08-08T07:58:48Z","timestamp":1312790328000},"page":"52-74","source":"Crossref","is-referenced-by-count":9,"title":["Enhancing discretized formulations: the knapsack reformulation and the star reformulation"],"prefix":"10.1007","volume":"20","author":[{"given":"Lu\u00eds","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Moura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,9]]},"reference":[{"key":"212_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.omega.2010.08.002","volume":"39","author":"M Albareda-Sambola","year":"2011","unstructured":"Albareda-Sambola M, Fern\u00e1ndez E, Saldanha\u00a0da\u00a0Gama F (2011) The facility location problem with Bernoulli demands. Omega 39:335\u2013345","journal-title":"Omega"},{"key":"212_CR2","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1002\/net.20144","volume":"49","author":"P Belotti","year":"2007","unstructured":"Belotti P, Brunetta L, Malucelli F (2007) Multicommodity network design with discrete node costs. Networks 49:90\u201399","journal-title":"Networks"},{"issue":"5","key":"212_CR3","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/j.orl.2006.10.009","volume":"35","author":"M Constantino","year":"2007","unstructured":"Constantino M, Gouveia L (2007) Reformulation by discretization: application to Economic Lot Sizing. Oper Res Lett 35(5):645\u2013650","journal-title":"Oper Res Lett"},{"issue":"6","key":"212_CR4","doi-asserted-by":"crossref","first-page":"2103","DOI":"10.1016\/j.cor.2006.10.014","volume":"35","author":"I Correia","year":"2008","unstructured":"Correia I, Gouveia L, Saldanha\u00a0da\u00a0Gama F (2008) Solving the variable size bin packing problem with discretized formulations. Comput Oper Res 35(6):2103\u20132113","journal-title":"Comput Oper Res"},{"issue":"2","key":"212_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.ejor.2009.10.027","volume":"204","author":"I Correia","year":"2010","unstructured":"Correia I, Gouveia L, Saldanha\u00a0da\u00a0Gama F (2010) Discretized formulations for capacitated location problems with modular distribution costs. Eur J Oper Res 204(2):237\u2013244","journal-title":"Eur J Oper Res"},{"key":"212_CR6","doi-asserted-by":"crossref","first-page":"1268","DOI":"10.1287\/mnsc.49.9.1268.16570","volume":"49","author":"K Croxton","year":"2003","unstructured":"Croxton K, Gendron B, Magnanti T (2003) A comparison of mixed-integer programming models for non-convex piecewise linear cost minimization problems. Manag Sci 49:1268\u20131273","journal-title":"Manag Sci"},{"issue":"1","key":"212_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.20166","volume":"50","author":"A Cunha","year":"2007","unstructured":"Cunha A, Lucena A (2007) Lower and upper bounds for the degree-constrained minimum spanning tree problem. Networks 50(1):55\u201366","journal-title":"Networks"},{"key":"212_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.orl.2003.10.008","volume":"32","author":"G Dahl","year":"2004","unstructured":"Dahl G, Foldnes N, Gouveia L (2004) A note on hop-constrained walk polytopes. Oper Res Lett 32:345\u2013349","journal-title":"Oper Res Lett"},{"key":"212_CR9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0167-6377(03)00026-9","volume":"32","author":"G Dahl","year":"2004","unstructured":"Dahl G, Gouveia L (2004) On the directed hop-constrained shortest path problem. Oper Res Lett 32:15\u201322","journal-title":"Oper Res Lett"},{"key":"212_CR10","doi-asserted-by":"crossref","unstructured":"Duhamel C, Gouveia L, Moura P, Souza M (2011, to appear) Minimum cost degree constrained spanning trees with node-degree costs. Networks. doi: 10.1002\/net.20445","DOI":"10.1002\/net.20445"},{"issue":"6","key":"212_CR11","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1016\/j.dam.2008.04.022","volume":"157","author":"A Frangioni","year":"2009","unstructured":"Frangioni A, Gendron B (2009) 0\u20131 reformulations of the network loading problem. Discrete Appl Math 157(6):1229\u20131241","journal-title":"Discrete Appl Math"},{"key":"212_CR12","unstructured":"Garey M, Johnson D (1979) Computers and intractability: a\u00a0guide to the theory of NP-completeness. San Francisco"},{"key":"212_CR13","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.43.1.130","volume":"43","author":"L Gouveia","year":"1995","unstructured":"Gouveia L (1995) A 2n constraint formulation for the capacitated minimal spanning tree problem. Oper Res 43:130\u2013141","journal-title":"Oper Res"},{"key":"212_CR14","volume-title":"Proceedings from the EWGLAXVII conference","author":"L Gouveia","year":"2008","unstructured":"Gouveia L, Moura P (2008) On discretized models for capacitated concentrator location problems: using double discretization. In: Proceedings from the EWGLAXVII conference, Elche, Spain"},{"key":"212_CR15","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.endm.2010.05.125","volume":"36","author":"L Gouveia","year":"2010","unstructured":"Gouveia L, Moura P (2010) Spanning trees with node degree dependent costs and knapsack reformulations. Electron Notes Discrete Math 36:985\u2013992","journal-title":"Electron Notes Discrete Math"},{"issue":"1","key":"212_CR16","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.cor.2010.04.016","volume":"38","author":"L Gouveia","year":"2011","unstructured":"Gouveia L, Moura P, Sousa A (2011) Prize collecting Steiner trees with node degree dependent costs. Comput Oper Res 38(1):234\u2013245","journal-title":"Comput Oper Res"},{"key":"212_CR17","doi-asserted-by":"crossref","first-page":"1242","DOI":"10.1016\/j.cor.2004.09.013","volume":"33","author":"L Gouveia","year":"2006","unstructured":"Gouveia L, Saldanha\u00a0da\u00a0Gama F (2006) On the capacitated concentrator location problem: a\u00a0reformulation by discretization. Comput Oper Res 33:1242\u20131258","journal-title":"Comput Oper Res"},{"key":"212_CR18","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0377-2217(93)E0238-S","volume":"83","author":"L Gouveia","year":"1995","unstructured":"Gouveia L, Vo\u00df S (1995) Classification of formulations for the (time-dependent) traveling salesman problem. Eur J Oper Res 83:69\u201382","journal-title":"Eur J Oper Res"},{"issue":"3","key":"212_CR19","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/j.ejor.2004.09.006","volume":"171","author":"H H\u00f6ller","year":"2006","unstructured":"H\u00f6ller H, Vo\u00df S (2006) A heuristic approach for combined equipment-planning and routing in multi-layer SDH\/WDM networks. Eur J Oper Res 171(3):787\u2013796","journal-title":"Eur J Oper Res"},{"key":"212_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"key":"212_CR21","volume-title":"Handbooks in operational research and management science: optimal trees","author":"T Magnanti","year":"1995","unstructured":"Magnanti T, Wolsey L (1995) In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds) Handbooks in operational research and management science: optimal trees"},{"key":"212_CR22","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1016\/j.cor.2009.10.010","volume":"37","author":"P Martins","year":"2010","unstructured":"Martins P (2010) Extended and discretized formulations for the maximum clique problem. Comput Oper Res 37:1348\u20131358","journal-title":"Comput Oper Res"},{"key":"212_CR23","unstructured":"Moura P (2009) Problema da\u00a0\u00c1rvore de\u00a0Suporte de\u00a0Custo M\u00ednimo com Restri\u00e7\u00e3o de\u00a0Grau e\u00a0Custos Associados aos Nodos. PhD thesis, Faculty of Sciences, University of Lisbon, Portugal, December"},{"issue":"2","key":"212_CR24","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10107-006-0043-y","volume":"112","author":"E Uchoa","year":"2008","unstructured":"Uchoa E, Fukasawa R, Lysgaard J, Pessoa A, Poggi\u00a0de\u00a0Arag\u00e3o M, Andrade D (2008) Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation. Math Program 112(2):443\u2013472","journal-title":"Math Program"},{"key":"212_CR25","volume-title":"Integer programming","author":"L Wolsey","year":"1998","unstructured":"Wolsey L (1998) Integer programming. Wiley, New York"}],"container-title":["TOP"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11750-011-0212-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11750-011-0212-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11750-011-0212-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T22:06:40Z","timestamp":1560463600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11750-011-0212-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,9]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["212"],"URL":"https:\/\/doi.org\/10.1007\/s11750-011-0212-x","relation":{},"ISSN":["1134-5764","1863-8279"],"issn-type":[{"type":"print","value":"1134-5764"},{"type":"electronic","value":"1863-8279"}],"subject":[],"published":{"date-parts":[[2011,8,9]]}}}