Papers
Very Large-Scale Neighborhood Search Techniques in Timetabing Problems - by Carol Meyers and James B. Orlin.
Accepted to the 6th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2006).
We discuss three techniques from very large-scale neighborhood search that can be used in designing algorithms for timetabling problems.
Approximation Results for the Pup Matching Problem - by Carol Meyers and Andreas S. Schulz. Working Paper.
We investigate formulations, variations, and approximation algorithms for a problem arising in the trucking industry.
The Integer Equal Flow Problem - by Carol Meyers, James B. Orlin, and Andreas S. Schulz. Working Paper.
We examine the approximability of the integer equal flow problem, a network flow problem that finds applications in modeling water resource systems.
Complexity in Congestion Games - by Carol Meyers and Andreas S. Schulz. Working Paper.
We address the complexity of finding minimum cost (system-optimal) solutions to congestion games, which arise in traffic modeling.
Equilibria in k-Splittable Congestion Games - by Carol Meyers and Andreas S. Schulz. Working Paper.
We explore problems of existence, computability, and the price of anarchy for pure Nash equilibria in k-splittable congestion games.
Copies of working papers available from the authors upon request.
Carol Meyers
Lawrence Livermore National Laboratory, L-229
7000 East Avenue
Livermore, CA 94550
Phone: (925) 422-1252
Email: carol@mit.edu