Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Matlab / rank | |||
Normal rank | |||
Revision as of 17:57, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Knapsack feasibility as an absolute value equation solvable by successive linear programming |
scientific article |
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
