General Purpose Heuristics for Integer Programming—Part II

  • Authors:

  • Fred Glover;Manuel Laguna

  • Affiliations:

  • US WEST Chair in Systems Science, Graduate School of Business Administration, University of Colorado, Boulder, CO 80309-0419. E-mail: Fred.Glover@Colorado.EDU;Graduate School of Business Administration, University of Colorado, Boulder, CO 80309-0419. E-mail: Manuel.Laguna@Colorado.EDU

  • Venue:
  • Journal of Heuristics
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

In spite of the many special purpose heuristics for specific classesof integer programming (IP) problems, there are few developments thatfocus on general purpose integer programming heuristics. This stemspartly from the perception that general purpose methods are likely tobe less effective than specialized procedures for specific problems,and partly from the perception that there is no unifying theoreticalbasis for creating general purpose heuristics. Still, there is ageneral acknowledgment that methods which are not limited to solvingIP problems on a “class by class” basis, but which apply to abroader range of problems, have significant value. We provide atheoretical framework and associated explicit proposals forgenerating general purpose IP heuristics. Our development, makes useof cutting plane derivations that also give a natural basis formarrying heuristics with exact branch and cut methods for integerprogramming problems.