A Fast Approximation Algorithm For The Subset-Sum Problem
From MaRDI portal
Publication:4313818
DOI10.1080/03155986.1994.11732245zbMath0823.90103MaRDI QIDQ4313818
Publication date: 29 November 1994
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1994.11732245
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
Related Items
An optimization algorithm for the clearing of interbank payments, An efficient fully polynomial approximation scheme for the Subset-Sum problem.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time randomizing algorithm for searching ranked functions
- Fast approximation algorithm for job sequencing with deadlines
- New scaling algorithms for the assignment and minimum mean cycle problems
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
- A new saling algorithm for the maximum mean cut problem
- Approximate binary search algorithms for mean cuts and cycles
- Fast Approximation Algorithms for Knapsack Problems
- THE MULTIPLE-CHOICE KNAPSACK PROBLEM