{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T09:00:11Z","timestamp":1695200411493},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,2,14]],"date-time":"2007-02-14T00:00:00Z","timestamp":1171411200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10107-007-0098-4","type":"journal-article","created":{"date-parts":[[2007,2,13]],"date-time":"2007-02-13T13:12:30Z","timestamp":1171372350000},"page":"207-234","source":"Crossref","is-referenced-by-count":6,"title":["Second-order cover inequalities"],"prefix":"10.1007","volume":"114","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,2,14]]},"reference":[{"key":"98_CR1","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. Program. 8: 146\u2013164","journal-title":"Math. Program."},{"key":"98_CR2","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H.P. Crowder","year":"1983","unstructured":"Crowder H.P., Johnson E.L. and Padberg M.W. (1983). Solving large-scale zero-one linear programming problems. Oper. Res. 31: 803\u2013834","journal-title":"Oper. Res."},{"key":"98_CR3","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/opre.17.3.437","volume":"17","author":"A.M. Geoffrion","year":"1969","unstructured":"Geoffrion A.M. (1969). An improved implicit enumeration approach for integer programming. Oper. Res. 17: 437\u2013454","journal-title":"Oper. Res."},{"key":"98_CR4","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F. Glover","year":"1965","unstructured":"Glover F. (1965). A multiphase-dual algorithm for the zero-one integer programming problem. Oper. Res. 13: 879\u2013919","journal-title":"Oper. Res."},{"key":"98_CR5","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/mnsc.17.9.568","volume":"17","author":"F. Glover","year":"1971","unstructured":"Glover F. (1971). Flows in arborescences. Manage. Sci. 17: 568\u2013586","journal-title":"Manage. Sci."},{"issue":"2","key":"98_CR6","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1023\/A:1008621204567","volume":"8","author":"F. Glover","year":"1997","unstructured":"Glover F., Sherali H.D. and Lee Y. (1997). Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming. Comput. Optim. Appl. 8(2): 152\u2013172","journal-title":"Comput. Optim. Appl."},{"key":"98_CR7","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 G.L. and Savelsbergh M.W.P. (1998). Cover inequalities for 0\u20131 linear programs: computation. INFORMS J. Comput. 10: 427\u2013437","journal-title":"INFORMS J. Comput."},{"key":"98_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P.L. Hammer","year":"1975","unstructured":"Hammer P.L., Johnson E.L. and Peled U.N. (1975). Facets of regular 0\u20131 polytopes. Math. Program. 8: 179\u2013206","journal-title":"Math. Program."},{"key":"98_CR9","unstructured":"Hanafi, S.: Contribution \u00e0 la r\u00e9solution de probl\u00e8mes duaux de grande taille en optimisation combinatoire. Ph.D. Thesis, University of Valenciennes, France (1993)"},{"key":"98_CR10","unstructured":"Hanafi, S., Glover, F.: Exploiting nested inequalities and surrogate constraints. Research Report, University of Valenciennes, France, and University of Colorado, Boulder, CO, USA (2005)"},{"key":"98_CR11","doi-asserted-by":"crossref","unstructured":"Hooker, J.N.: Logic-based methods for optimization. In: Borning, A. (ed.) Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, Vol. 874, pp. 336\u2013349 (1994)","DOI":"10.1007\/3-540-58601-6_111"},{"key":"98_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"96\u201397","author":"J.N. Hooker","year":"1999","unstructured":"Hooker J.N. and Osorio M.A. (1999). Mixed logical\/linear programming. Discrete Appl. Math. 96\u201397: 395\u2013442","journal-title":"Discrete Appl. Math."},{"key":"98_CR13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"Nemhauser G.L., Savelsbergh M.W.P. and Sigismondi G.S. (1994). MINTO, a mixed INTeger optimizer. Oper. Res. Lett. 15: 47\u201358","journal-title":"Oper. Res. Lett."},{"key":"98_CR14","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1999","unstructured":"Nemhauser G.L. and Wolsey L.A. (1999). Integer and Combinatorial Optimization. 2nd edn. Wiley, New York","edition":"2"},{"key":"98_CR15","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1021513321301","volume":"117","author":"M.A. Osorio","year":"2002","unstructured":"Osorio M.A., Glover F. and Hammer P. (2002). Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions. Ann. Oper. Res. 117: 71\u201393","journal-title":"Ann. Oper. Res."},{"key":"98_CR16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M.W.P. Savelsbergh","year":"1994","unstructured":"Savelsbergh M.W.P. (1994). Preprocessing and probing for mixed integer programming problems. ORSA J. Comput. 6: 445\u2013454","journal-title":"ORSA J. Comput."},{"issue":"1","key":"98_CR17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/S0895480192230607","volume":"8","author":"H.D. Sherali","year":"1995","unstructured":"Sherali H.D. and Lee Y. (1995). Sequential and simultaneous liftings of minimal cover inequalities for generalized upper bound constrained knapsack polytopes. SIAM J. Discrete Math. 8(1): 133\u2013153","journal-title":"SIAM J. Discrete Math."},{"key":"98_CR18","unstructured":"Spielberg, K., Guignard, M.: A sequential (Quasi) hot start method for BB (0, 1) mixed integer programming. Mathematical Programming Symposium, Atlanta, GA (2000)"},{"key":"98_CR19","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2004.01.024","volume":"165","author":"M. Vasquez","year":"2005","unstructured":"Vasquez M. and Vimont Y. (2005). Improved results on the 0\u20131 multidimensional knapsack problem. Eur. J. Oper. Res. 165: 70\u201381","journal-title":"Eur. J. Oper. Res."},{"key":"98_CR20","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey L.A. (1975). Faces for a linear inequality in 0\u20131variables. Math. Program. 8: 165\u2013178","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0098-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-007-0098-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0098-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:03Z","timestamp":1559123403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-007-0098-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,14]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["98"],"URL":"https:\/\/doi.org\/10.1007\/s10107-007-0098-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2,14]]}}}