A computational study of an objective hyperplane search heuristic for the general integer linear programming problem (Q1368436)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1067142
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational study of an objective hyperplane search heuristic for the general integer linear programming problem |
scientific article; zbMATH DE number 1067142 |
Statements
A computational study of an objective hyperplane search heuristic for the general integer linear programming problem (English)
0 references
22 January 1998
0 references
general integer programming
0 references
objective hyperplane search
0 references
bounded knapsack problem
0 references
heuristic algorithm
0 references
0.9173672795295716
0 references
0.8355358242988586
0 references
0.7722356915473938
0 references
0.7491410970687866
0 references
