A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4821526 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4527034 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Dynamic and Stochastic Knapsack Problem with Random Sized Items / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Dynamic and Stochastic Knapsack Problem with Deadlines / rank | |||
Normal rank | |||
Latest revision as of 21:13, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A PTAS for the chance-constrained knapsack problem with random item sizes |
scientific article |
Statements
A PTAS for the chance-constrained knapsack problem with random item sizes (English)
0 references
8 June 2010
0 references
stochastic knapsack
0 references
chance constraint
0 references
approximation schemes
0 references
0 references
