Solving Hard Problems in
Combinatorial Optimization
CSCI 2580, Tuesday/Thursday 10:30-12:00 (I hour)
Location CIT 506
Links to lecture slides and assignments
can be found on the class schedule.
(You have to load the schedule page via the
department's internal web server in
order to be able to download the documents.)
| Jan 22, 2008 |
Lectures start on Tuesday,
January 29th.
|
| Feb 4, 2008 |
There is now a mailing list
for the course. If your e-mail has not already been added
to the list, please log on to http://list.cs.brown.edu/mailman/listinfo/csci2580 to subscribe.
|
| Feb 5, 2008 |
There is an extension to the
deadline of the first part of the Knapsack Assignment.
Due date is now Thursday, Feb 14.
|
| Feb 5, 2008 |
The Graph Coloring
assignment is out. Due date is Feb 28th.
|
| Mar 11, 2008 |
The TSP assignment is out.
Due date is Apr 10th.
|
| Mar 20, 2008 |
We have posted a specifications handout for the TSP assignment.
You can find it on the class schedule.
|
|
The theory of combinatorial optimization and how it is embodied
in practical systems. Explores issues encountered in
implementing such systems. Emphasizes the wide variety of
techniques and methodologies available, including
,
,
,
and
,
Problems addressed
include: scheduling, coloring, traveling salesman tours, and resource allocation.
Prerequisites: CSCI 0320 (CS 32) or CSCI
0360 (CS 36), and basic knowledge of linear algebra.
|
|
|
|