On a variant of the change-making problem

DOI10.1016/J.ORL.2024.107165MaRDI QIDQ6988289zbMATH OpenFDO

Authors Adam N. Letchford, Licong Cheng

Publication date 5 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107165

zbMATH Keywords

change-making problemcombinatorial optimisationknapsack problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• A polynomial-time algorithm for the change-making problem
• Algorithmic Solution of the Change-Making Problem
• Characterization of canonical systems with six types of coins for the change-making problem
• Combinatorics of the change-making problem
• Hard Equality Constrained Integer Knapsacks
• scientific article; zbMATH DE number 2127418 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• More on change-making and related problems
• On the change-making problem
• Optimal and canonical solutions of the change making problem
• Optimal bounds for the change-making problem
• The Change-Making Problem

This page was built for publication: On a variant of the change-making problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988289)