Advertisement

Integer Programming and LP Relaxation

  • Jiří Matoušek
  • Bernd Gärtner
Chapter
Part of the Universitext book series (UTX)

Abstract

In Section 2.7 we encountered a situation in which among all feasible solutions of a linear program, only those with all components integral are of interest in the practical application. A similar situation occurs quite often in attempts to apply linear programming, because objects that can be split into arbitrary fractions are more an exception than the rule.When hiring workers, scheduling buses, or cutting paper rolls one somehow has to deal with the fact that workers, buses, and paper rolls occur only in integral quantities.

Keywords

Feasible Solution Bipartite Graph Integer Program Vertex Cover Integral Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2007

Authors and Affiliations

  • Jiří Matoušek
    • 1
  • Bernd Gärtner
    • 2
  1. 1.Department of Applied MathematicsCharles UniversityPraha 1Czech Republic
  2. 2.Institute of Theoretical Computer ScienceETH ZurichZurichSwitzerland

Personalised recommendations