Abstract
In this paper we discuss the derivation of strong valid inequalities for (mixed) integer knapsack sets based on lifting of valid inequalities for basic knapsack sets with two integer variables (and one continuous variable). The basic polyhedra can be described in polynomial time. We use superadditive valid lifting functions in order to obtain sequence independent lifting. Most of these superadditive functions and valid inequalities are not obtained in polynomial time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agra, A., Constantino, M.: Description of 2-integer continuous knapsack polyhedra. Discrete Optimization (in press) (2006)
Agra, A., Constantino, M.: Lifting 2-integer knapsack inequalities. Technical report, University of Lisbon, Centro de Investigação Operacional (2005)
Atamtürk, A.: Flow pack facets of single node fixed-charge flow polytope. Operations Research Letters 29, 107–114 (2001)
Atamtürk, A.: On capacitated network design cut-set polyhedra. Mathematical Programming 92, 425–437 (2002)
Atamtürk, A.: On the facets of the mixed-integer knapsack polyhedron. Mathematical Programming 98, 145–175 (2003)
Atamtürk, A.: Sequence independent lifting for mixed-integer programming. Operations Research 52 (3), 487–490 (2004)
Gomory, R.: Some polyhedra related to combinatorial problems. Linear algebra and its applications 2, 451–558 (1969)
Gu, Z., Nemhauser, G., Savelsbergh, M.: Lifted flow cover inequalities for mixed 0–1 integer programs. Mathematical Programming 85 (3), 439–467 (1999)
Gu, Z., Nemhauser, G., Savelsbergh, M.: Sequence independent lifting in mixed integer programming. Journal of Combinatorial Optimization 4, 109–129 (2000)
Hirschberg, D., Wong, C.: A polynomial-time algorithm for the knapsack problem with two variables. Journal of the Association for Computing Machinery 23 (1), 147–154 (1976)
Louveaux, Q., Wolsey, L.: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. 4OR 1 (3), 173–207 (2003)
Marchand, H., Wolsey, L.: The 0–1 knapsack problem with a single continuous variable. Mathematical Programming 85 (1), 15–33 (1999)
Marchand, H., Wolsey, L.: Aggregation and mixed integer rounding to solve mips. Operations Research 49 (3), 363–371 (2001)
Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley (&) Sons (1988)
Pochet, Y., Wolsey, L.: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization, and separation. Discrete Applied Mathematics 59, 57–74 ( 1995)
Rajan, D.: Designing capacitated survivable networks: Polyhedral analysis and algorithms, PhD thesis, University of California, Berkeley (2004)
Weismantel, R.: Hilbert bases and the facets of special knapsack polytopes. Mathematics of Operations Research 21, 886–904 (1996)
Wolsey, L.: Valid inequalities and superadditivity for 0–1 integer programs. Mathematics of Operations Research 2, 66–77 (1977)
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by Centro de Estudos em Optimização e Controlo from the ``Fundação para a Ciência e a Tecnologia'' FCT, cofinanced by the European Community Fund FEDER/POCTI.
This work was partially carried out within the framework of ADONET, a European network in Algorithmic Discrete Optimization, contract no. MRTN-CT-2003-504438 and partially supported by Centro de Investigação Operacional from the ``Fundação para a Ciência e a Tecnologia'' FCT, cofinanced by the European Community Fund FEDER/POCTI.
Rights and permissions
About this article
Cite this article
Agra, A., Constantino, M. Lifting two-integer knapsack inequalities. Math. Program. 109, 115–154 (2007). https://doi.org/10.1007/s10107-006-0705-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-006-0705-9