Location of Repository

Computational experience with generic decomposition using the DIP framework

By M. V. Galati, T. K. Ralphs and J. Wang

Abstract

Decomposition methods are techniques for exploiting the tractable substructures of an integer program in order to obtain improved solution techniques. In particular, the fundamental idea is to exploit our ability to either optimize over and/or separate from the convex hull of solutions to a given relaxation in order to derive improved methods of bounding the optimal solution value

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.308.4539
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://coral.ie.lehigh.edu/~te... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.