A polynomial-time algorithm for the change-making problem

被引：16
|
作者：
Pearson, D [1 ]
机构：
[1] BBN Technol, Cambridge, MA 02138 USA
来源：
OPERATIONS RESEARCH LETTERS | 2005年 / 33卷 / 03期
基金：
美国国家科学基金会;
关键词：
change-making; coin systems; greedy algorithm;
D O I：
10.1016/j.orl.2004.06.001
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
Optimally making change-representing a given value with the fewest coins from a set of denominations-is in general NP-hard. In most real money systems however, the greedy algorithm is optimal. We give a polynomial-time algorithm to determine, for a given coin system, whether the greedy algorithm is optimal. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：231 / 234
页数：4
相关论文
共 50 条
  • [1] POLYNOMIAL-TIME ALGORITHM FOR THE ORBIT PROBLEM
    KANNAN, R
    LIPTON, RJ
    JOURNAL OF THE ACM, 1986, 33 (04) : 808 - 821
  • [2] CHANGE-MAKING PROBLEM
    WRIGHT, JW
    JOURNAL OF THE ACM, 1975, 22 (01) : 125 - 128
  • [3] On the Change-Making Problem
    Chan, Timothy M.
    He, Qizheng
    2020 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2020, : 38 - 42
  • [4] On a variant of the change-making problem
    Letchford, Adam N.
    Cheng, Licong
    OPERATIONS RESEARCH LETTERS, 2024, 57
  • [5] A Polynomial-Time Algorithm for the Maximum Clique Problem
    Akbari, Zohreh O.
    2013 IEEE/ACIS 12TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS), 2013, : 503 - 507
  • [6] A stable, polynomial-time algorithm for the eigenpair problem
    Armentano, Diego
    Beltran, Carlos
    Buergisser, Peter
    Cucker, Felipe
    Shub, Michael
    JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 2018, 20 (06) : 1375 - 1437
  • [7] A polynomial-time algorithm for the bistable roommates problem
    Sethuraman, J
    Teo, CP
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 63 (03) : 486 - 497
  • [8] Combinatorics of the change-making problem
    Adamaszek, Anna
    Adamaszek, Michal
    EUROPEAN JOURNAL OF COMBINATORICS, 2010, 31 (01) : 47 - 63
  • [9] ALGORITHMIC SOLUTION OF CHANGE-MAKING PROBLEM
    CHANG, SK
    GILL, A
    JOURNAL OF THE ACM, 1970, 17 (01) : 113 - &
  • [10] POLYNOMIAL-TIME ALGORITHM FOR KNAPSACK PROBLEM WITH 2 VARIABLES
    HIRSCHBERG, DS
    WONG, CK
    JOURNAL OF THE ACM, 1976, 23 (01) : 147 - 154
12345