Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem

DOI10.1287/opre.25.3.404zbMath0372.90093OpenAlexW1975206074MaRDI QIDQ4149227

No author found.

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1287/opre.25.3.404

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

A new lower bound for the linear knapsack problem with general integer variables ⋮ Optimal and canonical solutions of the change making problem ⋮ When greedy gives optimal: a unified approach ⋮ Characterization of canonical systems with six types of coins for the change-making problem ⋮ Heuristic methods and applications: A categorized survey ⋮ Combinatorics of the change-making problem