Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!linus!philabs!seismo!hao!hplabs!sri-unix!dsn.umcp-cs@UDel-Relay From: dsn.umcp-cs%UDel-Relay@sri-unix.UUCP Newsgroups: net.ai Subject: Re: a simple logic/number theory/A I/scheduling/graph Message-ID: <2834@sri-arpa.UUCP> Date: Tue, 5-Jul-83 10:33:11 EDT Article-I.D.: sri-arpa.2834 Posted: Tue Jul 5 10:33:11 1983 Date-Received: Mon, 11-Jul-83 00:18:06 EDT Lines: 12 From: Dana S. Nau. . . Using coins of value v[1],...,v[n] find a set of coins for which any amount less than M can be accumulated and which minimizes the number of coins over those such sets. This problem appears similar (although not identical) to the 0/1 Knapsack problem, and thus is probably NP-hard. For approaches to solving it, I would recommend Branch and Bound (for example, see Fundamentals of Computer Algorithms, by Horowitz and Sahni). Dana S. Nau