The change-making problem for six coin values and beyond

DOI10.1016/J.DISC.2025.114669MaRDI QIDQ6930294zbMATH OpenFDO

Authors Cornelia A. Van Cott, Qiyu Zhang

Publication date 16 September 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114669

zbMATH Keywords

change-making problemgreedy algorithmknapsack problem

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
• Canonical Coin Changing and Greedy Solutions
• Change-making problems revisited: a parameterized point of view
• Characterization of canonical systems with six types of coins for the change-making problem
• Combinatorics of the change-making problem
• Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem
• 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
• Optimal bounds for the change-making problem
• Orderly Currencies
• Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems
• Totally greedy coin sets and greedy obstructions
• When greedy gives optimal: a unified approach
• When the Greedy Solution Solves a Class of Knapsack Problems

This page was built for publication: The change-making problem for six coin values and beyond

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