You are here

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

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?

Old Node ID: 
1909
Author(s): 
Saul I. Gass (University of Maryland)
Publication Date: 
Wednesday, June 11, 2008
Original Publication Source: 
Mathematics Magazine
Original Publication Date: 
April, 1996
Subject(s): 
Discrete Mathematics
Linear Programming
Flag for Digital Object Identifier: 
Publish Page: 
Furnished by JSTOR: 
File Content: 
Rating Count: 
16.00
Rating Sum: 
45.00
Rating Average: 
2.81
Author (old format): 
Saul I. Gass
Applicable Course(s): 
2.5 Intro Math Modeling
Modify Date: 
Saturday, September 6, 2008
Average: 2.8 (16 votes)

Dummy View - NOT TO BE DELETED