Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1021725517203 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1523445389 / rank | |||
Normal rank | |||
Latest revision as of 09:05, 30 July 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
0 references
0 references
