A competitive local search heuristic for the subset sum problem

DOI10.1016/S0305-0548(98)00046-XzbMath0947.90053OpenAlexW2124450228MaRDI QIDQ1302591

Nilotpal Chakravarti, Diptesh Ghosh

Publication date: 22 September 1999

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00046-x

zbMATH Keywords

heuristicslocal searchsubset sum

Mathematics Subject Classification ID

Search theory (90B40)

Related Items

Neighborhood search heuristics for the uncapacitated facility location problem