Pages that link to "Item:Q429647"
From MaRDI portal
The following pages link to An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647):
Displaying 12 items.
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
- Tight complexity bounds for the two-dimensional real knapsack problem (Q1300669) (← links)
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem (Q1383928) (← links)
- On the two-dimensional knapsack problem (Q1433651) (← links)
- Approximation algorithms for a two-phase knapsack problem (Q1790954) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- On the approximability of the two-phase knapsack problem (Q2279756) (← links)
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (Q2351163) (← links)
- (Q3141274) (← links)
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
- Faster Approximation Schemes for the Two-Dimensional Knapsack Problem (Q4973043) (← links)
- A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH (Q5267564) (← links)