Solving Hard Integer Programs

Primary tabs

We discuss some classes of computationally hard integer programming instances. A common feature is that they remain hard even for very few variables. For one of the classes we analyze why a particular reformulation is easy to solve. The reformulation makes use of a lattice interpretation and the analysis uses knowledge of the corresponding lattice determinant.


  • Workflow Status: Published
  • Created By: Barbara Christopher
  • Created: 10/08/2010
  • Modified By: Fletcher Moore
  • Modified: 10/07/2016


No keywords were submitted.

Target Audience