lifting

Lifting 2-integer knapsack inequalities

  • Agostinho Agra
  • Miguel Constantino
    • Categories Integer Programming Tags , ,

    In this paper we discuss the generation 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 description of the basic polyhedra can be made in polynomial time. We use superadditive valid functions in order to obtain … Read more

    Cover and pack inequalities for (mixed) integer programming

  • Alper Atamturk
    • Categories (Mixed) Integer Linear Programming, Cutting Plane Approaches Tags , , ,

    We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer knapsack set, and the mixed integer knapsack set. Our aim is to give a unified presentation of the inequalities based on covers and packs and highlight the connections among … Read more