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

A. Joseph, S. I. Gass, N. A. Bryson

Research output: Contribution to journalArticle

3 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)63-76
Number of pages14
JournalMathematical and Computer Modelling
Volume25
Issue number10
DOIs
StatePublished - May 1 1997

Keywords

  • Bounded knapsack problem
  • General integer programming
  • Heuristic algorithm
  • Objective hyperplane search

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computer Science Applications

Fingerprint Dive into the research topics of 'A computational study of an objective hyperplane search heuristic for the general integer linear programming problem'. Together they form a unique fingerprint.

  • Cite this