On the complexity of the continuous unbounded knapsack problem with uncertain coefficients (Q2488199): 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/j.orl.2004.11.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007637529 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minmax regret linear resource allocation problems. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hyperbolic 0-1 programming and query optimization in information retrieval / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3993418 / rank | |||
Normal rank | |||
Latest revision as of 14:33, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the continuous unbounded knapsack problem with uncertain coefficients |
scientific article |
Statements
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients (English)
0 references
25 August 2005
0 references
Polynomial algorithm
0 references
Complexity
0 references
Minmax regret optimization
0 references
