{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:06:14Z","timestamp":1747548374627},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594086"},{"type":"electronic","value":"9783540492450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59408-6_45","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:16:06Z","timestamp":1330258566000},"page":"110-123","source":"Crossref","is-referenced-by-count":6,"title":["A framework for tightening 0\u20131 programs based on extensions of pure 0\u20131 KP and SS problems"],"prefix":"10.1007","author":[{"given":"L. F.","family":"Escudero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Martello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580428","volume":"8","author":"A.L. Brearly","year":"1975","unstructured":"A.L. Brearly, G. Mitra and H.P. Williams, Analysis of mathematical programming problems prior to applying the Simplex algorithm, Mathematical Programming 8 (1975) 54\u201383.","journal-title":"Mathematical Programming"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"E. Balas, Facets of the knapsack polytope, Mathematical Programming 8 (1975) 146\u2013164.","journal-title":"Mathematical Programming"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"39","author":"E. Balas","year":"1978","unstructured":"E. Balas and E. Zemel, Facets of the knapsack polytope from minimal covers, SIAM J. of Applied Mathematics 39 (1978) 119\u2013148.","journal-title":"SIAM J. of Applied Mathematics"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"H. Crowder, E.L. Johnson and M.W. Padberg, Solving large-scale zero-one linear programming problems, Operations Research 31 (1983) 803\u2013834.","journal-title":"Operations Research"},{"key":"9_CR5","first-page":"139","volume":"1","author":"B.L. Dietrich","year":"1993","unstructured":"B.L. Dietrich, L.F. Escudero, A. Gar\u00edn and G. P\u00e9rez, O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates, TOP Trabajos de Investigaci\u00f3n-Operativa 1 (1993) 139\u2013160.","journal-title":"TOP Trabajos de Investigaci\u00f3n-Operativa"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0166-218X(93)90044-O","volume":"42","author":"B.L. Dietrich","year":"1993","unstructured":"B.L. Dietrich, L.F. Escudero and F. Chance, Efficient reformulation for 0\u20131 programs. Methods and Computational results, Discrete Applied Mathematics 42 (1993) 144\u2013176.","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01589396","volume":"42","author":"L.F. Escudero","year":"1988","unstructured":"L.F. Escudero, S3 sets. An extension of the Beale-Tomlin special ordered sets, Mathematical Programming 42 (1988) 113\u2013123.","journal-title":"Mathematical Programming"},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.29.1.49","volume":"29","author":"M. Guignard","year":"1981","unstructured":"M. Guignard and K. Spielberg, Logical Reduction Methods in Zero-One Programming (Minimal Preferred Variables), Operations Research 29 (1981) 49\u201374.","journal-title":"Operations Research"},{"key":"9_CR9","unstructured":"IBM, MPSX, Mathematical Programming System Extended\/370, Reference Manual, SH19-6553, 1988."},{"key":"9_CR10","unstructured":"IBM, OSL, Optimization Subroutine Library, Guide and Reference, SC23-0519, 1990."},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.33.4.803","volume":"35","author":"E.L. Johnson","year":"1985","unstructured":"E.L. Johnson, M.M. Kostreva and U.H. Suhl, Solving 0\u20131 integer programming problems arising form large-scale planning models, Operations Research 35 (1985) 803\u2013819.","journal-title":"Operations Research"},{"key":"9_CR12","first-page":"121","volume":"3","author":"K.L. Hoffman","year":"1991","unstructured":"K.L. Hoffman and M.W. Padberg, Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut, SIAM J. on Computing 3 (1991) 121\u2013128.","journal-title":"SIAM J. on Computing"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1287\/mnsc.30.6.765","volume":"30","author":"S. Martello","year":"1984","unstructured":"S. Martello and P. Toth, A mixture of dynamic programming and branch-and-bound for the subset-sum problem, Management Science 30 (1984) 765\u2013771.","journal-title":"Management Science"},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1287\/mnsc.34.5.633","volume":"34","author":"S. Martello","year":"1988","unstructured":"S. Martello and P. Toth, A new algorithm for the 0\u20131 knapsack problem, Management Science 34 (1988) 633\u2013644.","journal-title":"Management Science"},{"key":"9_CR15","volume-title":"Knapsack problems: Algorithms and computer implementations","author":"S. Martello","year":"1990","unstructured":"S. Martello and P. Toth, Knapsack problems: Algorithms and computer implementations (J. Wiley, Chichester, 1990)."},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"G.L. Nemhauser, M.W.P. Savelsbergh and G.C. Sigismondi, MINTO, a ixed Integer Optimizer, Operations Research Letters 15 (1994) 47\u201358.","journal-title":"Operations Research Letters"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"M.W. Padberg","year":"1975","unstructured":"M.W. Padberg, A note on zero-one programming, Technical Report, New York University, 1973. See also Operations Research 23 (1975) 833\u2013837.","journal-title":"Operations Research"},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M.W.P. Savelsbergh","year":"1994","unstructured":"M.W.P. Savelsbergh, Preprocessing and probing techniques for mixed integer programming problems, ORSA J. on Computing 6 (1994) 445\u2013454.","journal-title":"ORSA J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59408-6_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:27:16Z","timestamp":1619558836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59408-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594086","9783540492450"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-59408-6_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}