Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable (Q489742): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the facets of the mixed-integer knapsack polyhedron / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4821303 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The 0-1 knapsack problem with a single continuous variable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank | |||
Normal rank | |||
Latest revision as of 13:40, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable |
scientific article |
Statements
Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable (English)
0 references
21 January 2015
0 references
knapsack
0 references
single continuous variable
0 references
approximation algorithm
0 references
0 references
