Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:38, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a class of multiplicative programs with 0-1 knapsack constraints |
scientific article |
Statements
Solving a class of multiplicative programs with 0-1 knapsack constraints (English)
0 references
16 March 2000
0 references
multiplicative programming
0 references
\(0-1\) knapsack problems
0 references
concave minimization
0 references
branch-and-bound algorithms
0 references
Lagrangian relaxation
0 references
