An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem (Q1291694)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem |
scientific article; zbMATH DE number 1299895
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem |
scientific article; zbMATH DE number 1299895 |
Statements
An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem (English)
0 references
22 February 2001
0 references
integer-programming
0 references
objective hyperplane search
0 references
general integer variables
0 references
composite constraints
0 references
bounded knapsack problem
0 references
