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

by Saul I. Gass (University of Maryland)

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.