{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:12:49Z","timestamp":1710335569727},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,11,12]],"date-time":"2014-11-12T00:00:00Z","timestamp":1415750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10878-014-9812-3","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:36:47Z","timestamp":1415983007000},"page":"1111-1129","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Implicit cover inequalities"],"prefix":"10.1007","volume":"31","author":[{"given":"Agostinho","family":"Agra","sequence":"first","affiliation":[]},{"given":"Cristina","family":"Requejo","sequence":"additional","affiliation":[]},{"given":"Eul\u00e1lia","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,12]]},"reference":[{"key":"9812_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0305-0548(82)90026-0","volume":"9","author":"V Aggarwal","year":"1982","unstructured":"Aggarwal V, Aneja YP, Nair KPK (1982) Minimal spanning tree subject to a side constraint. Comput Oper Res 9:287\u2013296","journal-title":"Comput Oper Res"},{"key":"9812_CR2","doi-asserted-by":"crossref","unstructured":"Agra A, Cerveira A, Requejo C, Santos E (2011) On the weight-constrained minimum spanning tree problem. In: Proceedings of the International Network Optimization Conference, volume 6701 of Lecture Notes in Computer Science, pp 156\u2013161","DOI":"10.1007\/978-3-642-21527-8_20"},{"key":"9812_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0377-2217(95)00248-0","volume":"95","author":"L Amado","year":"1996","unstructured":"Amado L, B\u00e1rcia P (1996) New polynomial bounds for matroidal knapsacks. Eur J Oper Res 95:201\u2013210","journal-title":"Eur J Oper Res"},{"key":"9812_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0123007","volume":"23","author":"E Balas","year":"1972","unstructured":"Balas E, Jeroslow R (1972) Canonical cuts on the unit hypercube. SIAM J Appl Math 23:61\u201379","journal-title":"SIAM J Appl Math"},{"key":"9812_CR5","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E Balas","year":"1975","unstructured":"Balas E (1975) Facets of the knapsack polytope. Math Programm 8:146\u2013164","journal-title":"Math Programm"},{"key":"9812_CR6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E Balas","year":"1978","unstructured":"Balas E, Zemel E (1978) Facets of the knapsack polytope from minimal covers. SIAM J Appl Math 34:119\u2013148","journal-title":"SIAM J Appl Math"},{"key":"9812_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-6377(84)90009-9","volume":"3","author":"PM Camerini","year":"1984","unstructured":"Camerini PM, Vercellis C (1984) The matroidal knapsack: a class of (often) well-solved problems. Oper Res Lett 3:157\u2013162","journal-title":"Oper Res Lett"},{"key":"9812_CR8","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H Crowder","year":"1983","unstructured":"Crowder H, Johnson EL, Padberg MW (1983) Solving large-scale zero-one linear programming problems. Oper Res 31:803\u2013835","journal-title":"Oper Res"},{"key":"9812_CR9","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z Gu","year":"1998","unstructured":"Gu Z, Nemhauser GL, Savelsbergh MWP (1998) Lifted cover inequalities for 0\u20131 integer programs: Computation. INFORMS J Comput 10:427\u2013437","journal-title":"INFORMS J Comput"},{"key":"9812_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"10","author":"Z Gu","year":"2000","unstructured":"Gu Z, Nemhauser GL, Savelsbergh MWP (2000) Sequence independent lifting in mixed integer programming. J Combin Optim 10:109\u2013129","journal-title":"J Combin Optim"},{"key":"9812_CR11","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"PL Hammer","year":"1975","unstructured":"Hammer PL, Johnson EL, Peled UN (1975) Facets of regular 0\u20131 polytopes. Math Programm 8:179\u2013206","journal-title":"Math Programm"},{"key":"9812_CR12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1137\/S0097539703426775","volume":"33","author":"R Hassin","year":"2004","unstructured":"Hassin R, Levin A (2004) An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM J Comput 33:261\u2013268","journal-title":"SIAM J Comput"},{"key":"9812_CR13","unstructured":"Henn ST (2007) Weight-constrained minimum spanning tree problem. Master\u2019s thesis, University of Kaiserslautern, Kaiserslautern"},{"key":"9812_CR14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.orl.2003.06.003","volume":"32","author":"SP Hong","year":"2004","unstructured":"Hong SP, Chung SJ, Park BH (2004) A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Oper Res Lett 32:233\u2013239","journal-title":"Oper Res Lett"},{"key":"9812_CR15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.ejor.2007.01.032","volume":"186","author":"K Kaparis","year":"2008","unstructured":"Kaparis K, Letchford AN (2008) Local and global lifted cover inequalities for the 0\u20131 multidimensional knapsack problem. Eur J Oper Res 186:91\u2013103","journal-title":"Eur J Oper Res"},{"key":"9812_CR16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10107-010-0359-5","volume":"124","author":"K Kaparis","year":"2010","unstructured":"Kaparis K, Letchford AN (2010) Separation algorithms for 0\u20131 knapsack polytopes. Math Programm 124:69\u201391","journal-title":"Math Programm"},{"key":"9812_CR17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0167-6377(98)00025-X","volume":"23","author":"D Klabjan","year":"1998","unstructured":"Klabjan D, Nemhauser GL, Tovey C (1998) The complexity of cover inequality separation. Oper Res Lett 23:35\u201340","journal-title":"Oper Res Lett"},{"key":"9812_CR18","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01589098","volume":"45","author":"M Laurent","year":"1989","unstructured":"Laurent M (1989) A generalization of antiwebs to independence systems and their canonical facets. Math Programm 45:97\u2013108","journal-title":"Math Programm"},{"key":"9812_CR19","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, Chichester"},{"key":"9812_CR20","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York"},{"key":"9812_CR21","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger D (2005) Where are the hard knapsack problems? Comput Oper Res 32:2271\u20132284","journal-title":"Comput Oper Res"},{"key":"9812_CR22","doi-asserted-by":"crossref","unstructured":"Ravi R, Goemans MX (1996) The constrained minimum spanning tree problem. In: Proceedings of the Scandinavian Workshop on Algorithmic Theory, volume 1097 of Lecture Notes in Computer Science, pp 66\u201375","DOI":"10.1007\/3-540-61422-2_121"},{"key":"9812_CR23","doi-asserted-by":"crossref","unstructured":"Requejo C, Agra A, Cerveira A, Santos E (2010) Formulations for the weight-constrained minimum spanning tree problem. In: Proceedings of the International Conference on Numerical Analysis and Applied Mathematics, volume 1281 of AIP Conference Proceedings, pp 2166\u20132169","DOI":"10.1063\/1.3498397"},{"key":"9812_CR24","unstructured":"Requejo C, Santos E (2011) Lagrangean based algorithms for the weight-constrained minimum spanning tree problem. In: Proceedings of the VII ALIO\/EURO Workshop on Applied Combinatorial Optimization, pp 38\u201341"},{"key":"9812_CR25","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"TJ Roy van","year":"1987","unstructured":"van Roy TJ, Wolsey LA (1987) Solving mixed integer programming problems using automatic reformulation. Oper Res 35:45\u201357","journal-title":"Oper Res"},{"key":"9812_CR26","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/net.3230130203","volume":"13","author":"A Shogan","year":"1983","unstructured":"Shogan A (1983) Constructing a minimal-cost spanning tree subject to resource constraints and flow requirements. Networks 13:169\u2013190","journal-title":"Networks"},{"key":"9812_CR27","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"LA Wolsey","year":"1975","unstructured":"Wolsey LA (1975) Facets for a linear inequality in 0\u20131 variables. Math Programm 8:165\u2013178","journal-title":"Math Programm"},{"key":"9812_CR28","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/00207160412331290667","volume":"82","author":"T Yamada","year":"2005","unstructured":"Yamada T, Watanabe K, Kataoka S (2005) Algorithms to solve the knapsack constrained maximum spanning tree problem. Int J Comput Math 82:23\u201334","journal-title":"Int J Comput Math"},{"key":"9812_CR29","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/moor.14.4.760","volume":"14","author":"E Zemel","year":"1989","unstructured":"Zemel E (1989) Easily computable facets of the knapsack polytope. Math Oper Res 14:760\u2013765","journal-title":"Math Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9812-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9812-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9812-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:25Z","timestamp":1559276605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9812-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,12]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9812"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9812-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,12]]}}}