Volume 7, Issue 1 -
Spring/Summer 1999

Volume 6, Issue 3
Fall 1998

Volume 6, Issue 2
Spring/Summer 1998

Volume 6, Issue 1
Winter 1998

Volume 5, Issue 4
Fall 1997

Volume 5, Issue 3
Summer 1997

Volume 5, Issue 2
Spring 1997

Volume 5, Issue 1
Winter 1997

Volume 4, Issue 4
Fall 1996

Volume 4, Issue 3
Summer 1996

Volume 4, Issue 2
Spring 1996

Volume 4, Issue 1
Winter 1996

Volume 3, Issue 4
Fall 1995

Volume 3, Issue 3
Summer 1995

Volume 3, Issue 2
Spring 1995

Volume 3, Issue 1
January 1995

Volume 2, Issue 4
October 1994

Volume 2, Issue 3
July 1994

Volume 2, Issue 2
April 1994

Volume 2, Issue 1
January 1994

Volume 1, Issue 4
October 1993

Volume 1, Issue 3
July 1993

Volume 1, Issue 2
April 1993

Volume 1, Issue 1
January 1993

CRPC COLLABORATIVE RESEARCH

CRPC researcher Bob Bixby (pictured third from the right) with associates from Texaco and Silicon Graphics. A group of researchers (Bixby, Applegate, Chvatal, and Cook) who had previously solved the world's largest Traveling Salesman Problem in 1993, broke the record again by solving for 7397 cities. They also solved for the smallest previously unsolved number (225). The group was given pre-release use of 10 20-processor 150 MHz SGI XL Challenge machines, shown in the background of this photo. Using these machines, Bixby said that they were able to work on problems that previously took years to solve with other workstations.
Table of Contents