A computational study of an objective hyperplane search heuristic for the general integer linear programming problem

  • Authors:

  • A. Joseph;S. I. Gass;N. A. Bryson

  • Affiliations:

  • Department of Management, University of Miami Coral Gables, FL 33124, U.S.A.;College of Business and Management, University of Maryland College Park, MD 20742, U.S.A.;Department of Information Systems and Analysis, Howard University Washington, DC 20059, U.S.A.

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 1997

Quantified Score

Hi-index 0.98

Visualization

Abstract

The paper describes an objective function hyperplane search heuristic for solving the general all-integer linear programming problem (ILP). The algorithm searches a series of objective function hyperplanes and the search over any given hyperplane is formulated as a bounded knapsack problem. Theory developed for combinations of the objective function and problem constraints is used to guide the search. We evaluate the algorithm's performance on a class of ILP problems to assess the areas of effectiveness.