Well-solvable instances for the partition problem

DOI10.1016/j.aml.2005.11.016zbMath1278.90334OpenAlexW1988592616MaRDI 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 complexitycombinatorial optimizationpartition problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item

This page was built for publication: Well-solvable instances for the partition problem