Well-solvable instances for the partition problem

DOI10.1016/j.aml.2005.11.016zbMath1278.90334MaRDI QIDQ2371107

Gerhard J. Woeginger, Vladimir G. Deǐneko

Publication date: 29 June 2007

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2005.11.016

zbMATH Keywords

computational complexity; combinatorial optimization; partition problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C60: Abstract computational complexity for mathematical programming problems

90C27: Combinatorial optimization

Cites Work

• Unnamed Item