Pages that link to "Item:Q1790954"
From MaRDI portal
The following pages link to Approximation algorithms for a two-phase knapsack problem (Q1790954):
Displaying 10 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)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
- On the approximability of the two-phase knapsack problem (Q2279756) (← links)
- Improved approximation algorithms for a bilevel knapsack problem (Q2354770) (← links)
- Faster Approximation Schemes for the Two-Dimensional Knapsack Problem (Q4973043) (← links)
- Approximation Algorithms for a Bi-level Knapsack Problem (Q5199165) (← links)
- A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH (Q5267564) (← links)