*Result*: Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms.
Title:
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms.
Authors:
Richard, J. -P. P.1 Jpacc@isye.gatech.edu, De Farias Jr., I. R.2 defarias@core.ucl.ac.be, Nemhause, G. L.1 george.nemhauser@isye.gatech.edu
Source:
Mathematical Programming. Sep2003, Vol. 98 Issue 1-3, p89-113. 25p. 2 Diagrams, 2 Charts, 1 Graph.
Subject Terms:
Database:
Business Source Premier
*Further Information*
*Examines the mixed 0-1 knapsack polytope (PS), which is defined by a knapsack contraint that contains 0-1 and bounded continuous variables. Characteristics of PS; Information on the related polyhedron; Lifting theory for continuous variables.*