MIP 2007 Workshop on Mixed Integer Programming

July 30 - August 2, 2007

Program

 

Monday, July 30, 2007

09:30 - 10:15
Registration and Coffee & Croissants
Room 1221


Meeting room : 1360

10:15 - 10:30
Opening remarks
10:30 - 11:15
Egon Balas
(Carnegie Mellon University)
Projecting systems of linear inequalities in binary variables
Abstract

Diapos/Slides
11:15 - 12:00
François Soumis
(École Polytechnique de Montréal)
Solution methods for large scale real life integer programming problems
Abstract

12:00 - 14:00
Lunch Break


Meeting room : 1360

14:00 - 14:45
Shabbir Ahmed
(Georgia Institute of Technology)
Probabilistically constrained linear programming
Abstract

Diapos/Slides
14:45 - 15:30
Daniel Bienstock
(Columbia University)
Solving discrete models in robust portfolio optimization
Abstract

Diapos/Slides
15:30 - 16:00
Coffee break
Room 1221
16:00 - 16:45
Annegret Wagler
(Otto-von-Guericke-University Magdeburg)
An exact approach for the network reconstruction problem
Abstract
16:45 - 17:30
Gabor Pataki
(University of North Carolina at Chapel Hill)
The Parallel Approximation Problem and Subset Sums
Abstract

Diapos/Slides

17:30 - 20:00
Welcoming reception and Poster Session
Room 6245

 

Tuesday, July 31, 2007


Meeting room : 1360

09:15 - 10:00
Volker Kaibel
(Otto-von-Guericke Universität Magdeburg)
Polyhedral Aspects of Symmetry Breaking in Integer Programming
Abstract

Diapos/Slides
10:00 - 10:30
Simge Kucukyavuz
(University of Arizona)
Generalized Network Inequalities for Fixed-Charge Network Polyhedra
Abstract
10:30 - 11:00
Coffee break
Room 1221
11:00 - 11:45
Laurence Wolsey
(Université Catholique de Louvain)
MIR, Mixing and Network Dual MIPs: A Progress Report
Abstract

Diapos/Slides
11:45 - 12:30
Ismael de Farias
(University of Buffalo)
Simple-set cutting planes for mixed-integer programming
Abstract

12:30 - 15:00
Lunch Break and Poster Session


Meeting room : 1360

15:00 - 15:45
Ronald Rardin
(University of Arkansas)
Cutting Planes and Relaxations for Radiation Oncology Optimization under Dose-Volume Constraints
Abstract
15:45 - 16:30
Eva K. Lee
(Georgia Institute of Technology)
Large-Scale Optimization Strategies for Optimal Cancer Treatment Design
Abstract

19:00
Conference Dinner

 

Wednesday, August 1, 2007


Meeting room : 1360

09:15 - 10:00
Jacques Desrosiers
(HEC / GERAD)
Set Covering/Set Partitioning Applications
Abstract

Diapos/Slides
10:00 - 10:45
Suvrajeet Sen
(University of Arizona)
Economic Interpretation of Dual Multipliers in Integer Programming: The case of 0-1 MILP
Abstract

Diapos/Slides
10:45 - 11:15
Coffee break
Room 1221
11:15 - 12:00
Quentin Louveaux
(Université Catholique de Louvain)
Cutting planes and infeasibility certificates from lattice-point-free polyhedra
Abstract

Diapos/Slides
12:00 - 12:30
Yanjun Li
(Purdue University)
Cook, Kannan and Schrijver's Example Revisited
Abstract

12:30 - 15:00
Lunch Break


Meeting room : 1360

15:00 - 15:45
Mohit Tawarmalani
(Purdue University)
Generating strong cuts for nonlinear programs by lifting inequalities
Abstract
15:45 - 16:30
George Nemhauser
(Georgia Tech)
Strategic Planning with Start-Time Dependent Variable Costs: A Case Study in Solving Non-linear Integer Models
Abstract

Diapos/Slides
16:30 - 17:00
Jeff Linderoth
(University of Wisconsin-Madison)
A Different Perspective on Perspective Cuts
Abstract

Diapos/Slides

17:30 - 18:00
Business Meeting and Round-table Discussion
Room 1360

 

Thursday, August 2, 2007


Meeting room : 1360

09:15 - 09:45
Francois Margot
(Carnegie Mellon University)
Testing Cut Generators for ILP
Abstract
09:45 - 10:30
Andrea Lodi
(University of Bologna)
On the Strengthening of Mixed Integer Gomory Cuts
Abstract

Diapos/Slides
10:30 - 11:15
Cole Smith
(University of Florida)
Enhanced Cutting Planes for a Class of Binary Multi-Level Optimization Algorithms
Abstract
11:15 - 11:30
Conference Wrap-up and Last Chances