Skip Navigation

The Computer Journal 1969 12(4):377-380; doi:10.1093/comjnl/12.4.377
© 1969 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (16)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lunnon, W. F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A postage stamp problem

W. F. Lunnon *

SRC Atlas Computer Laboratory, Chilton, Didcot, UK

The postage stamp problem consists of choosing, for a given n and m, a set of n integers such that

  1. sums of m (or fewer) of these integers can realise the numbers 1, 2, 3, ..., N–1,
  2. the value of N in (a) above is as large as possible.

This paper discusses a computational approach to the problem.

Received February 1969.

* Department of Computer Science, University of Manchester

§ Now at SRC Atlas Computer Laboratory, Chilton, Didcot, Berkshire


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.