Experimental Algorithmics, with a Focus on Branch and
Bound for Discrete Optimization Problems

Dates: June 20 - June 26, 2004
(Sunday evening through Saturday afternoon)

Module Development Topics

Some Problems are NP-harder than Others
Sally Cockburn, Hamilton College
Ben Coleman, Moravian College
Bruce Mattingly, SUNY Cortland
Kay Somers, Moravian College

An Integer Programming Approach to the Broadcast Domination Problem
Steve Horton, United States Military Academy
Claudio N. de Meneses, University of Florida
M. Erol Ulucakli, Lafayette College
Arup Mukherjee, Montclair State University

Mixed Integer Programming for Undergraduates
Zhonguan Che, Penn State Beaver
Ken Kalmanson, Montclair State
Ann Moskol, Rhode Island College

Implementation of primal heuristics in Mixed Integer Programs
Kumar Abhishek, Lehigh University
Ashutosh Mahajan, Lehigh University

Solving Problems with Integer Programming
Boting Yang, University of Regina
Jamiiru Luttamaguzi, Elizabeth City State University
Michael Pelsmajer, Illinois Institute of Technology
Zhizhang Shen, Plymouth State University