What question did this study set out to answer?

The research aims to provide a linear integer programming method for computing the Sylvester denumerant, which is NP-hard.

Linear integer programming and the computation of the Sylvester denumerant

View Full Paper

Ask AI

Bookmark

Authors

Linear integer programming computes larger Sylvester denumerants, indicating progress in combinatorial number theory.

The research aims to provide a linear integer programming method for computing the Sylvester denumerant, which is NP-hard.
Developed a linear integer programming approach based on earlier work.
Compared practical results to existing computation methods.
Tested methods on denumerants larger than previously documented.
Successfully computed examples of larger Sylvester denumerants.
Demonstrated effectiveness of the new approach compared to existing methods.

Jiménez-Tafur et al. (2026) studied this question.

View Full Paper

Ask AI

Bookmark