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 条

[21] A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
Ma, SH
Liang, DM
SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 1997, 40 (03): : 301 - 311
[22] An approximation polynomial-time algorithm for a sequence bi-clustering problem
A. V. Kel’manov
S. A. Khamidullin
Computational Mathematics and Mathematical Physics, 2015, 55 : 1068 - 1076
[23] A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM
NAKAYAMA, A
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1987, 30 (03) : 265 - 290
[24] A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
Department of Computer Science, Shandong University, Jinan 250100, China
Sci China Ser E Technol Sci, 3 (x9-311):
[25] An approximation polynomial-time algorithm for a sequence bi-clustering problem
Kel'manov, A. V.
Khamidullin, S. A.
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2015, 55 (06) : 1068 - 1076
[26] A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
Shaohan Ma
Dongmin Liang
Science in China Series E: Technological Sciences, 1997, 40 : 301 - 311
[27] A POLYNOMIAL-TIME ALGORITHM FOR A LARGE SUBCLASS OF THE INTEGER KNAPSACK-PROBLEM
MILANOV, PB
DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1984, 37 (03): : 309 - 312
[28] A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
马绍汉
梁东敏
Science in China(Series E:Technological Sciences), 1997, (03) : 301 - 311
[29] A deterministic polynomial-time algorithm for Heilbronn's problem in three dimensions
Lefmann, H
Schmitt, N
SIAM JOURNAL ON COMPUTING, 2002, 31 (06) : 1926 - 1947
[30] COMPUTATIONAL EXPERIENCE WITH A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE TRANSPORTATION PROBLEM
IKURA, Y
NEMHAUSER, GL
DISCRETE APPLIED MATHEMATICS, 1986, 13 (2-3) : 239 - 248

← 1 2 3 4 5 →