Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724)
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: Knapsack feasibility as an absolute value equation solvable by successive linear programming |
scientific article; zbMATH DE number 5565962
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Knapsack feasibility as an absolute value equation solvable by successive linear programming |
scientific article; zbMATH DE number 5565962 |
Statements
Knapsack feasibility as an absolute value equation solvable by successive linear programming (English)
0 references
17 June 2009
0 references
knapsack feasibility
0 references
absolute value equations
0 references
successive linear programming
0 references
0 references
