Lifting two-integer knapsack inequalities

Authors:
A. Agra;M. F. Constantino
Affiliations:
Department of Mathematics, University of Aveiro, Campus Universitário de Santiago, 3810-193, Aveiro, Portugal;DEIO and CIO, University of Lisbon, Edifício C6, Campo Grande, 1749-016, Lisboa, Portugal
Venue:
Mathematical Programming: Series A and B
Year:
2007

Citing 0
Cited 2

Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms

INFORMS Journal on Computing
Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

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.