Knapsack Problems

2004/01/01 by Hans Kellerer, Ulrich Pferschy, David Pisinger · 8 citations
Computer Science · Engineering · #Computational Geometry and Mesh Generation #Metal Forming Simulation Techniques #Optimization and Packing Problems

paper · doi:10.1007/978-3-540-24777-7

crossref issued 2004/01/01 · crossref published 2004/01/01 · crossref published-print 2004/01/01 · openalex publication_date 2004/01/01 · crossref created 2012/11/22 · crossref deposited 2019/04/07 · openalex created_date 2022/05/12 · crossref indexed 2026/07/23 · openalex updated_date 2026/07/23

Cited by

• Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems
• On Strong NP-Completeness of Rational Problems
• Invitation to Fixed-Parameter Algorithms
• Combinatorial algorithms for inverse absolute and vertex 1‐center location problems on trees
• A Non-Stationary Bandit-Learning Approach to Energy-Efficient Femto-Caching With Rateless-Coded Transmission
• Solving optimization problems by the public goods game
• Algorithm [wikipedia]
• Knapsack problem [wikipedia]