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

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

doi:10.1016/S0895-7177(97)00075-7

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

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

Management Science

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	63-76
Number of pages	14
Journal	Mathematical and Computer Modelling
Volume	25
Issue number	10
DOIs	https://doi.org/10.1016/S0895-7177(97)00075-7
State	Published - May 1997

Keywords

Bounded knapsack problem
General integer programming
Heuristic algorithm
Objective hyperplane search

ASJC Scopus subject areas

Modeling and Simulation
Computer Science Applications

Access to Document

10.1016/S0895-7177(97)00075-7

Cite this

@article{737662779c8142589906e3af18b41b9a,

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

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.",

keywords = "Bounded knapsack problem, General integer programming, Heuristic algorithm, Objective hyperplane search",

author = "A. Joseph and Gass, {S. I.} and Bryson, {N. A.}",

year = "1997",

month = may,

doi = "10.1016/S0895-7177(97)00075-7",

language = "English (US)",

volume = "25",

pages = "63--76",

journal = "Mathematical and Computer Modelling",

issn = "0895-7177",

publisher = "Elsevier Limited",

number = "10",

}

TY - JOUR

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

AU - Joseph, A.

AU - Gass, S. I.

AU - Bryson, N. A.

PY - 1997/5

Y1 - 1997/5

N2 - 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.

AB - 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.

KW - Bounded knapsack problem

KW - General integer programming

KW - Heuristic algorithm

KW - Objective hyperplane search

UR - http://www.scopus.com/inward/record.url?scp=0031148471&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031148471&partnerID=8YFLogxK

U2 - 10.1016/S0895-7177(97)00075-7

DO - 10.1016/S0895-7177(97)00075-7

M3 - Article

AN - SCOPUS:0031148471

VL - 25

SP - 63

EP - 76

JO - Mathematical and Computer Modelling

JF - Mathematical and Computer Modelling

SN - 0895-7177

IS - 10

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this