A note on a general nonlinear knapsack problem (Q1081534): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(86)90107-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092883909 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A branch and search algorithm for a class of nonlinear knapsack problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reliability Optimization by Generalized Lagrangian-Function and Reduced-Gradient Methods / rank | |||
Normal rank | |||
Latest revision as of 15:12, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on a general nonlinear knapsack problem |
scientific article |
Statements
A note on a general nonlinear knapsack problem (English)
0 references
1986
0 references
general nonlinear knapsack problem
0 references
concave objective function
0 references
single convex constraint
0 references
continuous (relaxed) solution
0 references
lower and upper bounds
0 references
implicit enumeration
0 references
