Dynamic programming revisited: Improving knapsack algorithms
From MaRDI portal
Publication:1969304
DOI10.1007/s006070050042zbMath0946.90053OpenAlexW1966986652MaRDI QIDQ1969304
Publication date: 16 March 2000
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s006070050042
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39)
Related Items (14)
Exact solution of the robust knapsack problem ⋮ Exact approaches for the knapsack problem with setups ⋮ On lattice point counting in \(\varDelta\)-modular polyhedra ⋮ Integrated location and inventory planning in service parts logistics with customer-based service levels ⋮ Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems ⋮ On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems ⋮ Worst-case analysis of the subset sum algorithm for bin packing. ⋮ Algorithms for the bounded set-up knapsack problem ⋮ Efficient algorithms for real-life instances of the variable size bin packing problem ⋮ A problem reduction based approach to discrete optimization algorithm design ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems ⋮ Modified subset sum heuristics for bin packing ⋮ An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem
Uses Software
This page was built for publication: Dynamic programming revisited: Improving knapsack algorithms
