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 | |
| State | Published - May 1 1997 |
Fingerprint
Keywords
- Bounded knapsack problem
- General integer programming
- Heuristic algorithm
- Objective hyperplane search
ASJC Scopus subject areas
- Modeling and Simulation
- Computer Science Applications
Cite this
A computational study of an objective hyperplane search heuristic for the general integer linear programming problem. / Joseph, Anito; Gass, S. I.; Bryson, N. A.
In: Mathematical and Computer Modelling, Vol. 25, No. 10, 01.05.1997, p. 63-76.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
AU - Joseph, Anito
AU - Gass, S. I.
AU - Bryson, N. A.
PY - 1997/5/1
Y1 - 1997/5/1
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 -