Ellis L. Johnson

Facets of the Complementarity Knapsack Polytope

  • Ellis L. Johnson
  • George L. Nemhauser
  • Ismael de Farias
    • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms Tags , ,

    We present a polyhedral study of the complementarity knapsack problem, in which no auxiliary binary variables are introduced, but rather the inequalities are derived in the space of the continuous variables. Citation School of Industrial and Systems Engineering, GA Tech, under review Article Download View Facets of the Complementarity Knapsack Polytope