Linear Time Algorithms for Knapsack Problems with Bounded Weights
From MaRDI portal
Recommendations
- A linear-time algorithm for solving continuous maximin knapsack problems
- Constant-time approximation algorithms for the knapsack problem
- On linear-time algorithms for the continuous quadratic Knapsack problem
- Approximation algorithms for the weight-reducible knapsack problem
- Algorithms for the bounded set-up knapsack problem
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- A fast algorithm for the linear multiple-choice knapsack problem
- A minimal algorithm for the bounded knapsack problem
- A Minimal Algorithm for the Bounded Knapsack Problem
- Linear time-approximation algorithms for bin packing
Cited in
(40)- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- Modified subset sum heuristics for bin packing
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- Worst-case analysis of the subset sum algorithm for bin packing.
- New exact approaches and approximation results for the penalized knapsack problem
- A new fully polynomial time approximation scheme for the interval subset sum problem
- Change-making problems revisited: a parameterized point of view
- Efficient algorithms for real-life instances of the variable size bin packing problem
- Where are the hard knapsack problems?
- More on change-making and related problems
- Actively secure setup for SPDZ
- Target-based computer-assisted orchestration: complexity and approximation algorithms
- Faster algorithms for \(k\)-subset sum and variations
- Scheduling lower bounds via AND subset sum
- Approximating subset sum ratio via subset sum computations
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- A linear-time algorithm for solving continuous maximin knapsack problems
- Three is easy, two is hard: Open shop sum-batch scheduling problem refined
- scientific article; zbMATH DE number 2119958 (Why is no real title available?)
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- Capacitated dynamic programming: faster knapsack and graph algorithms
- A decentralized heuristic for multiple-choice combinatorial optimization problems
- On the hardness of energy minimisation for crystal structure prediction
- scientific article; zbMATH DE number 7651168 (Why is no real title available?)
- Structural parameterizations of budgeted graph coloring
- Learning-augmented algorithms for online subset sum
- Algebraic algorithms for variants of subset sum
- Faster algorithms for \(k\)-\textsc{Subset Sum} and variations
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Selfish bin covering
- Approximating subset sum ratio via partition computations
- Expectation analysis for bounding solutions of the 0-1 knapsack problem
- Scheduling lower bounds via and subset sum
- Output-sensitive complexity of multi-objective integer network flow problems
- Discrete effort distribution via regret-enabled greedy algorithm
- No polynomial kernels for knapsack
- Solving sequential knapsack problems
- Knapsack and subset sum with small items
- Even faster knapsack via rectangular monotone min-plus convolution and balancing
- Does subset sum admit short proofs?
This page was built for publication: Linear Time Algorithms for Knapsack Problems with Bounded Weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4939603)
