Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-008-0102-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2160639883 / rank | |||
Normal rank | |||
Revision as of 22:49, 19 March 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
