Pages that link to "Item:Q1964357"
From MaRDI portal
The following pages link to Approximation for knapsack problems with multiple constraints (Q1964357):
Displaying 18 items.
- Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- Knapsack with variable weights satisfying linear constraints (Q1683329) (← links)
- Approximation for multi-knapsack problem (Q1814715) (← links)
- Multi-constrained matroidal knapsack problems (Q1824560) (← links)
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions (Q1861918) (← links)
- Approximating the product knapsack problem (Q2230782) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- Knapsack problem with objective value gaps (Q2361124) (← links)
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights (Q2448903) (← links)
- A Fast Approximation Scheme for the Multiple Knapsack Problem (Q2891378) (← links)
- A Further Generalized Kettele Algorithm with Multiple Constraints (Q3202105) (← links)
- A Note on Approximation Schemes for Multidimensional Knapsack Problems (Q3718485) (← links)
- (Q4811939) (← links)
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (Q5470710) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897222) (← links)