CENTER Carnegie Mellon UniversityCarnegie Mellon Computer Science DepartmentSchool of Computer Science
Integrated Logistics Workshop II
Related Activities
Outreach Roadshow

March 27-29, 2003
Carnegie Mellon University, Pittsburgh, Pennsylvania

The second workshop of the Integrated Logistics PROBE will be held Thursday, March 27th, through Saturday, March 29th, 2003, at Carnegie Mellon University in Pittsburgh, PA. The summary of the first workshop (held in Princeton NJ on October 31 through November 1, 2002) can be foundhere

The purpose of the logistics PROBE is to bring together researchers and practitioners in Computer Science and Operations Research to discuss various problems in facility location, clustering, and network design. These problems were first considered in the context of locating warehouses to minimize the cost of product distribution, and subsequent work has shown them to be applicable to a wide range of fields including analysis of genetic data, clustering of large databases, and design of telecommunications networks. We expect a range of talks and speakers encompassing many aspects of these problems, from the applied perspective (what sorts of instances arise in various applications; how can we modify general theoretical techniques to deal with real-life issues), from the integer programming perspective (what techniques can we use to find exact solutions for large instances), and from the approximation perspective (how well can we approximate various problem types in polynomial, or even linear, running time).
The workshop will be a combination of survey talks, new results, and discussion sections. There will be no published proceedings, but we will have a web page with slides and a summary of the workshop.

Organizing committee: Moses Charikar, Ted Giford, Adam Meyerson, R. Ravi

Advance Registration Is Required by Monday, March 24th
Anyone planning to attend who has not yet registered (including CMU faculty and students) should register online as soon as possible.
Online Registration Form
All sessions will be held in Wean Hall 4623.
Directions and a map of the Carnegie Mellon campus
Ground transportation

Tentative Program

Thursday, 27 March 2003

9 am


9.30 - 10.30

Eva Tardos, Cornell
Network Design with Selfish Agents (abs)


11:00 - 12:30

Samir Khuller, Univ Maryland
Algorithms for Data Migration with Cloning (abs)

Adam Meyerson, CMU
Online Algorithms for Network Design

Ashish Goel, Stanford
Simultaneous Optimization with Concave Costs or Concave Profits (abs)

12:30 - 2:00
2:00 - 3:00

Discussion: Current challenges in logistics problems

3:00 - 3:30
3:30 - 5:00

Anupam Gupta, CMU
Designing networks without knowing the traffic matrix

Andrew Schaefer, Univ Pittsburgh
The Optimal Design and Operation of Remnant Inventory Systems (abs)

Moses Charikar, Princeton
Medians in Data Streams(pdf)


Dinner at Manuel and Lenore Blum's House. 1019 Devonshire Rd (between 5th and Forbes). 412 687-8730
See: Map to the Blums' house

Friday, 28 March 2003
9:00 am
Anant Balakrishnan, UT Austin
Network Design Models for Distribution Systems (abs) (pdf)
10:30 - 11:00
11:00 - 12:30

Prakash Mirchandani, Univ Pitt
Survivable Network Design (abs) (pdf)

Marc Goetschalckx, Georgia Tech
Modeling of strategic supply chain design problems under uncertainty (abs) (pdf)

Bruce Maggs, CMU
Designing Overlay Multicast Networks for Streaming (pdf)

12:30 - 2:00
2:00 - 3:00
Discussion: Modeling issues in logistics
3:00 - 3:30
3:30 - 5:00

Chandra Chekuri, Bell Labs
Building Edge-Failure Resilient Networks (abs) (pdf) (ppt)

Amit Kumar, Bell Labs
A constant-factor approximation algorithm for the multicommodity rent-or-buy problem (abs) (pdf) (ppt)

Martin Pal, Cornell
Multicommodity Rent or Buy: Approximation via Cost-Sharing (abs) (ppt) (pdf)

Saturday, 29 March 2003
9 am
9.30 - 10.30

Amitabh Sinha, CMU
Covering Graphs using Trees and Stars (abs) (pdf)

Tom Wexler, Cornell
Nash Equilibria in a New Connection Game (abs) (pdf) (ppt)

Srinivas Kashyap, Univ Maryland
Approximation algorithms for data placement on parallel disks (abs) (pdf)

Discussion: Open problems
Lunch and conclusion.

Read the Abstracts
See the PROBE



This material is based upon work supported by National Science Foundation under Grant No. 0122581.
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the
National Science Foundation