On Copying a Compact Disk to Cassette Tape: An Integer-Programming Approach

by Saul I. Gass (University of Maryland)

This article originally appeared in:
Mathematics Magazine
April, 1996

Subject classification(s): Discrete Mathematics | Linear Programming
Applicable Course(s): 2.5 Intro Math Modeling

How do you partition \(n\) items of varying length into two sets so that the sum of the lengths in each set are as close as possible to being equal?

A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.