{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T01:44:41Z","timestamp":1764812681777},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,10]]},"DOI":"10.1007\/s10479-005-3442-1","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T22:31:07Z","timestamp":1126823467000},"page":"21-38","source":"Crossref","is-referenced-by-count":48,"title":["Cover and Pack Inequalities for (Mixed) Integer Programming"],"prefix":"10.1007","volume":"139","author":[{"given":"Alper","family":"Atamt\u00fcrk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3442_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0166-218X(01)00337-7","volume":"123","author":"K. Aardal","year":"2002","unstructured":"Aardal, K., R. Weismantel, and L.A. Wolsey. (2002). \u201cNon-Standard Approaches to Integer Programming.\u201d Discrete Applied Mathematics 123, 5\u201374.","journal-title":"Discrete Applied Mathematics"},{"key":"3442_CR2","first-page":"312","volume":"2","author":"J. Ar\u00e1oz","year":"2003","unstructured":"Ar\u00e1oz, J., L. Evans, E.L. Johnson, and R.E. Gomory. (2003). \u201cCyclic Group and Knapsack Facets.\u201d Mathematical Programming 2, 312\u2013339.","journal-title":"Mathematical Programming"},{"key":"3442_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-6377(01)00100-6","volume":"29","author":"A. Atamt\u00fcrk","year":"2001","unstructured":"Atamt\u00fcrk, A. (2001). \u201cFlow Pack Facets of the Single Node Fixed-Charge Flow Polytope.\u201d Operations Research Letters 29, 107\u2013114.","journal-title":"Operations Research Letters"},{"key":"3442_CR4","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s101070100284","volume":"92","author":"A. Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk, A. (2002). \u201cOn Capacitated Network Design Cut-Set Polyhedra.\u201d Mathematical Programming 92, 425\u2013437.","journal-title":"Mathematical Programming"},{"key":"3442_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A. Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk, A. (2003). \u201cOn the Facets of the Mixed-Integer Knapsack Polyhedron.\u201d Mathematical Programming 98, 145\u2013175.","journal-title":"Mathematical Programming"},{"key":"3442_CR6","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.1030.0099","volume":"52","author":"A. Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A. (2004). \u201cSequence Independent Lifting for Mixed-Integer Programming.\u201d Operations Research, 52, 487\u2013490.","journal-title":"Operations Research"},{"key":"3442_CR7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s101070100284","volume":"92","author":"A. Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk, A. and D. Rajan. (2002). \u201cOn Splittable and Unsplittable Flow Capacitated Network Design Arc-Set Polyhedra.\u201d Mathematical Programming 92, 315\u2013333.","journal-title":"Mathematical Programming"},{"key":"3442_CR8","unstructured":"Atamt\u00fcrk, A. and D. Rajan. (2004). \u201cValid Inequalities for Mixed-Integer Knapsack from Two-Integer Variable Restrictions.\u201d Research Report BCOL.04.02, University of California at Berkeley. Available at http:\/\/ieor.berkeley.edu\/~atamturk."},{"key":"3442_CR9","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas, E. (1975). \u201cFacets of the Knapsack Polytope.\u201d Mathematical Programming 8, 146\u2013164.","journal-title":"Mathematical Programming"},{"key":"3442_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"Balas, E. and E. Zemel. (1978). \u201cFacets of the Knapsack Polytope from Minimal Covers.\u201d SIAM Journal of Applied Mathematics 34, 119\u2013148.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"3442_CR11","unstructured":"Balas, E. and E. Zemel. (1984). Lifting and Complementing Yields All Facets of Positive Zero\u2013One Programming Polytopes. In R.W.C. et al. (eds.), Proceedings of the International Conference on Mathematical Programming, pp. 13\u201324."},{"key":"3442_CR12","unstructured":"Brockm\u00fcller, B., O. G\u00fcnl\u00fck, and L.A. Wolsey. (1996). \u201cDesigning Private Line Networks\u2014Polyhedral Analysis and Computation.\u201d CORE Discussion Paper 9647, Universit\u00e9 Catholique de Louvain."},{"key":"3442_CR13","first-page":"201","volume":"81","author":"S. Ceria","year":"1998","unstructured":"Ceria, S., C. Cordier, H. Marchand, and L.A. Wolsey. (1998). \u201cCutting Planes for Integer Programs with General Integer Variables.\u201d Mathematical Programming 81, 201\u2013214.","journal-title":"Mathematical Programming"},{"key":"3442_CR14","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder, H., E.L. Johnson, and M.W. Padberg. (1983). \u201cSolving Large-Scale Zero-One Linear Programming Problems.\u201d Operations Research 31, 803\u2013834.","journal-title":"Operations Research"},{"key":"3442_CR15","doi-asserted-by":"crossref","unstructured":"Dash, S. and O. G\u00fcnl\u00fck. (2004). \u201cValid Inequalities Based on Simple Mixed-Integer Sets.\u201d In Proceedings of the 10th International Integer Programming and Combinatorial Optimization Conference, pp. 33\u201345.","DOI":"10.1007\/978-3-540-25960-2_3"},{"key":"3442_CR16","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0167-6377(02)00221-3","volume":"31","author":"L.E. Escudero","year":"2003","unstructured":"Escudero, L.E., A. Gar\u00edn, and G. P\u00e9res. (2003). \u201cAn O(n log n) Procedure for Identifying Facets of the Knapsack Polytope.\u201d Operations Research Letters 31, 211\u2013218.","journal-title":"Operations Research Letters"},{"key":"3442_CR17","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R.E. Gomory","year":"1969","unstructured":"Gomory, R.E. (1969). \u201cSome Polyhedra Related to Combinatorial Problems.\u201d Linear Algebra and Its Applications 2, 451\u2013558.","journal-title":"Linear Algebra and Its Applications"},{"key":"3442_CR18","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z. Gu","year":"1998","unstructured":"Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh. (1998). \u201cCover Inequalities for 0-1 Integer Programs: Computation.\u201d INFORMS Journal on Computing 10, 427\u2013437.","journal-title":"INFORMS Journal on Computing"},{"key":"3442_CR19","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/ijoc.11.1.117","volume":"11","author":"Z. Gu","year":"1999a","unstructured":"Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh. (1999a). \u201cCover Inequalities for 0-1 Integer Programs: Complexity.\u201d INFORMS Journal on Computing 11, 117\u2013123.","journal-title":"INFORMS Journal on Computing"},{"key":"3442_CR20","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Z. Gu","year":"1999b","unstructured":"Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh. (1999b). \u201cLifted Flow Cover Inequalities for Mixed 0-1 Integer Programs.\u201d Mathematical Programming 85, 439\u2013467.","journal-title":"Mathematical Programming"},{"key":"3442_CR21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Z. Gu","year":"2000","unstructured":"Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh. (2000). \u201cSequence Independent Lifting in Mixed Integer Programming.\u201d Journal of Combinatorial Optimization, 4:109\u2013129.","journal-title":"Journal of Combinatorial Optimization"},{"key":"3442_CR22","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P.L. Hammer","year":"1975","unstructured":"Hammer, P.L., E.L. Johnson, and U.N. Peled. (1975). \u201cFacets of Regular 0-1 Polytopes.\u201d Mathematical Programming 8, 179\u2013206.","journal-title":"Mathematical Programming"},{"key":"3442_CR23","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0167-6377(81)90019-5","volume":"1","author":"E.L. Johnson","year":"1981","unstructured":"Johnson, E.L. and M.W. Padberg. (1981). \u201cA Note on Knapsack Problem with Special Ordered Sets.\u201d Operations Research Letters 1, 18\u201322.","journal-title":"Operations Research Letters"},{"key":"3442_CR24","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1287\/moor.27.4.711.300","volume":"27","author":"D. Klabjan","year":"2002","unstructured":"Klabjan, D. and G.L. Nemhauser. (2002). \u201cA Polyhedral Study of Integer Variable Upper Bounds.\u201d Mathematics of Operations Research 27, 711\u2013739.","journal-title":"Mathematics of Operations Research"},{"key":"3442_CR25","unstructured":"Louveaux, Q. and L.A. Wolsey. (2003). \u201cLifting, Superadditivity, Mixed Integer Rounding, and Single Node Flow Sets Revisited.\u201d CORE Discussion Paper 2003\/1, Universit\u00e9 Catholique de Louvain."},{"key":"3442_CR26","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/net.3230230205","volume":"23","author":"T.L. Magnanti","year":"1993","unstructured":"Magnanti, T.L. and P. Mirchandani. (1993). \u201cShortest Paths, Single Origin-Destination Network Design, and Associated Polyhedra.\u201d Networks 23, 103\u2013121.","journal-title":"Networks"},{"key":"3442_CR27","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"T.L. Magnanti","year":"1993","unstructured":"Magnanti, T.L., P. Mirchandani, and R. Vachani. (1993). \u201cThe Convex Hull of Two Core Capacitated Network Design Problems.\u201d Mathematical Programming 60, 233\u2013250.","journal-title":"Mathematical Programming"},{"key":"3442_CR28","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H. Marchand","year":"1999","unstructured":"Marchand, H. and L.A. Wolsey. (1999). \u201cThe 0-1 Knapsack Problem with a Single Continuous Variable.\u201d Mathematical Programming 85, 15\u201333.","journal-title":"Mathematical Programming"},{"key":"3442_CR29","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H. Marchand","year":"2001","unstructured":"Marchand, H. and L.A. Wolsey. (2001). \u201cAggregation and Mixed Integer Rounding to Solve MIPs.\u201d Operations Research 49, 363\u2013371.","journal-title":"Operations Research"},{"key":"3442_CR30","unstructured":"Martin, A. and R. Weismantel. (1997). \u201cContribution to General Mixed Integer Knapsack Problems.\u201d Technical Report SC 97-38, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin."},{"key":"3442_CR31","unstructured":"Mazur, D.R. and L.A. Hall. (2002). \u201cFacets of a Polyhedron Closely Related to the Integer Knapsack-Cover Problem.\u201d Manuscript at http:\/\/www.optimization-online.org."},{"key":"3442_CR32","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0167-6377(94)90038-8","volume":"16","author":"G.L. Nemhauser","year":"1994","unstructured":"Nemhauser, G.L. and P. Vance. (1994). Lifted Cover Facets of the 0-1 Knapsack Polytope with GUB Constraints.\u201d Operations Research Letters 16, 255\u2013263.","journal-title":"Operations Research Letters"},{"key":"3442_CR33","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G.L. Nemhauser","year":"1990","unstructured":"Nemhauser, G.L. and L.A. Wolsey. (1990). \u201cA Recursive Procedure for Generating All Cuts for 0-1 Mixed Integer Programs.\u201d Mathematical Programming 46, 379\u2013390.","journal-title":"Mathematical Programming"},{"key":"3442_CR34","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"Padberg, M.W. (1973). \u201cOn the Facial Structure of Set Packing Polyhedra.\u201d Mathematical Programming 5, 199\u2013215.","journal-title":"Mathematical Programming"},{"key":"3442_CR35","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0167-5060(08)70831-8","volume":"4","author":"M.W. Padberg","year":"1979a","unstructured":"Padberg, M.W. (1979a). \u201cCovering, Packing and Knapsack Problems.\u201d Annals of Discrete Mathematics 4, 265\u2013287.","journal-title":"Annals of Discrete Mathematics"},{"key":"3442_CR36","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"M.W. Padberg","year":"1979b","unstructured":"Padberg, M.W. (1979b). \u201cA Note On 0-1 Programming.\u201d Operations Research 23, 833\u2013837.","journal-title":"Operations Research"},{"key":"3442_CR37","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01588301","volume":"18","author":"M.W. Padberg","year":"1980","unstructured":"Padberg, M. W. (1980). \u201c(1,k)-Configurations and Facets for Packing Problems.\u201d Mathematical Programming 18, 94\u201399.","journal-title":"Mathematical Programming"},{"key":"3442_CR38","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1137\/S1052623495285217","volume":"8","author":"Y. Pochet","year":"1998","unstructured":"Pochet, Y. and R. Weismantel. (1998). \u201cThe Sequential Knapsack Polytope.\u201d SIAM Journal on Optimization 8, 248\u2013264.","journal-title":"SIAM Journal on Optimization"},{"key":"3442_CR39","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(95)90600-K","volume":"59","author":"Y. Pochet","year":"1995","unstructured":"Pochet, Y. and L.A. Wolsey. (1995). \u201cInteger Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, Optimization, and Separation.\u201d Discrete Applied Mathematics 59, 57\u201374.","journal-title":"Discrete Applied Mathematics"},{"key":"3442_CR40","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-003-0398-2","volume":"98","author":"J. Richard","year":"2003","unstructured":"Richard, J., I.R. de Farias, and G.L. Nemhauser. (2003). \u201cLifted Inequalities for 0-1 Mixed Integer Programming : Basic Theory and Algorithms.\u201d Mathematical Programming 98, 89\u2013113.","journal-title":"Mathematical Programming"},{"key":"3442_CR41","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/S0895480192230607","volume":"8","author":"H.D. Sherali","year":"1995","unstructured":"Sherali, H.D. and Y. Lee. (1995). \u201cSequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes.\u201d SIAM Journal on Discrete Mathematics 8, 133\u2013153.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"3442_CR42","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s101070200292","volume":"92","author":"S.P.M. van Hoesel","year":"2002","unstructured":"van Hoesel, S.P.M., A.M.C.A. Koster, R.L.M.J. van de Leensel, and M.W.P. Savelsbergh. (2002). \u201cPolyhedral Results for the Edge Capacity Polytope.\u201d Mathematical Programming 92, 335\u2013358.","journal-title":"Mathematical Programming"},{"key":"3442_CR43","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1287\/moor.21.4.886","volume":"21","author":"R. Weismantel","year":"1996","unstructured":"Weismantel, R. (1996). \u201cHilbert Bases and the Facets of Special Knapsack Polytopes.\u201d Mathematics of Operations Research 21, 886\u2013904.","journal-title":"Mathematics of Operations Research"},{"key":"3442_CR44","first-page":"49","volume":"77","author":"R. Weismantel","year":"1997","unstructured":"Weismantel, R. (1997). On the 0\/1 Knapsack Polytope. Mathematical Programming 77, 49\u201368.","journal-title":"Mathematical Programming"},{"key":"3442_CR45","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey, L.A. (1975). \u201cFaces for Linear Inequality in 0-1 Variables.\u201d Mathematical Programming 8, 165\u2013178.","journal-title":"Mathematical Programming"},{"key":"3442_CR46","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.24.2.367","volume":"24","author":"L.A. Wolsey","year":"1976","unstructured":"Wolsey, L.A. (1976). Facets and Strong Valid Inequalities for Integer Programs.\u201d Operations Research 24, 367\u2013372.","journal-title":"Operations Research"},{"key":"3442_CR47","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1287\/moor.2.1.66","volume":"2","author":"L.A. Wolsey","year":"1977","unstructured":"Wolsey, L.A. (1977). \u201cValid Inequalities and Superadditivity for 0\/1 Integer Programs.\u201d Mathematics of Operations Research 2, 66\u201377.","journal-title":"Mathematics of Operations Research"},{"key":"3442_CR48","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BF01609032","volume":"15","author":"E. Zemel","year":"1978","unstructured":"Zemel, E. (1978). \u201cLifting the Facets of Zero-One Polytopes.\u201d Mathematical Programming 15, 268\u2013277.","journal-title":"Mathematical Programming"},{"key":"3442_CR49","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). \u201cEasily Computable Facets of the Knapsack Polytope.\u201d Mathematics of Operations Research 14, 760\u2013764.","journal-title":"Mathematics of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3442-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-3442-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3442-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:59:34Z","timestamp":1559152774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-3442-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["3442"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-3442-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}