by Diptesh Ghosh, Nilotpal Chakravarti
http://ganga.iiml.ac.in/~diptesh/papers/compls.ps
Add To MetaCart
Abstract:
competitive local search heuristic for the subset sum problem
Citations
|
7716
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
335
|
Knapsack Problems: Algo-rithms and Computer
– Martello, Toth
- 1990
|
|
194
|
Modern Heuristic Techniques for Combinatorial Problems
– Reeves
- 1993
|
|
53
|
Approximate algorithms for the 0-1 knapsack problem
– Sahni
- 1975
|
|
28
|
Hard Knapsack Problems
– Chvatal
- 1980
|
|
22
|
Cryptography: a Primer
– Konheim
- 1981
|
|
18
|
Easily searched encodings for number partitioning
– Ruml, Ngo, et al.
- 1996
|
|
9
|
General local search methods
– PIRLOT
- 1996
|
|
6
|
NP-completeness of some problems concerning voting games
– Prasad, Kelly
- 1990
|
|
4
|
Coefficient reduction for knapsack-like constraints in 0/1 programs with variable upper bounds
– Dietrich, Escudero
- 1990
|
|
3
|
A framework for tightening 0-1 programs based on extensions of pre 0-1
– Escudero, Martello, et al.
- 1996
|
|
2
|
Worst-case analysis of greedy algorithms for the subset-sum problem
– Martello, Toth
- 1984
|
|
1
|
Easy weighted majority games
– Chakravarti, Goel, et al.
|
|
1
|
Efficient reformulation for 0-1 programs: methods and computational results
– Dietrich, Escudero, et al.
- 1993
|
|
1
|
Worst-case analysis of an approximation scheme for the subset-sum problem
– Fischetti
- 1986
|
