The following pages link to (Q4821303):
Displaying 12 items.
- Online knapsack revisited (Q260271) (← links)
- Committee selection under weight constraints (Q449043) (← links)
- The off-line group seat reservation problem (Q613435) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity (Q958440) (← links)
- A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems (Q980008) (← links)
- Heuristics for container loading of furniture (Q1044119) (← links)
- Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← links)
- Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
- New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
- Tolerance analysis for 0-1 knapsack problems (Q1751719) (← links)
