An efficient fully polynomial approximation scheme for the Subset-Sum problem
Journal of Computer and System Sciences
Where are the hard knapsack problems?
Computers and Operations Research
Modified subset sum heuristics for bin packing
Information Processing Letters
Modified subset sum heuristics for bin packing
Information Processing Letters
History-based VLSI legalization using network flow
Proceedings of the 47th Design Automation Conference
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Minimal Equivalent Binary Knapsack Inequalities
INFORMS Journal on Computing
Theoretical Computer Science
Interval subset sum and uniform-price auction clearing
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Efficient algorithms for real-life instances of the variable size bin packing problem
Computers and Operations Research
Three is easy, two is hard: open shop sum-batch scheduling problem refined
Operations Research Letters
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
Operations Research Letters
Worst-case analysis of the subset sum algorithm for bin packing
Operations Research Letters
Hi-index | 0.00 |