COR@L Seminar Series 2003-04


Summer 2004 Presentations
Topic: Reliability Model for Facility Location with Risk Pooling
Authors:Hyong-Mo Jeon, Larry Snyder
Time:Tuesday 07/27/04 12:00pm - 1:00pm
Place:Mohler Laboratory - Room 355
Speaker:Hyong-Mo Jeon


Topic: Primal heuristics in MIPs
Time:Tuesday 07/13/04 12:00pm - 1:00pm
Place:Mohler Laboratory - Room 355
Speaker:Kumar Abhishek & Ashutosh Mahajan

Suggested Readings:
Emilie Danna, Edward Rothberg & Claude Le Pape. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming (to be published), 2004.

Matteo Fischetti & Andrea Lodi. Local branching. Mathematical -- --Programming, 98:23-47, 2002


Topic: Lookahead Branching for MIP
Authors:Wasu Glankwamdee, Jeff Linderoth
Time:Tuesday 07/06/04 12:00pm - 1:00pm
Place:Mohler Laboratory - Room 355
Speaker:Wasu Glankwamdee


Topic: SYMPHONY 5.0 Callable Library and Implementation
Authors:Menal Guzelsoy, Ted Ralphs
Time:Tuesday 06/29/04 12:00pm - 1:00pm
Place:Mohler Laboratory - Room 355
Speaker:Menal Guzelsoy


Topic: Facility Location-Routing-Scheduling Problem
Authors:Zeliha Akca, Rosemary Berger
Time:Tuesday 06/15/04 12:00pm - 1:00pm
Place:Mohler Laboratory - Room 355
Speaker:Zeliha Akca


Topic: Solving Multistage Stochastic Linear Programs on the Computational Grid
Authors:Jerry Shen, Jeff Linderoth
Time:Tuesday 06/08/04 12:00pm - 1:00pm
Place:Mohler Laboratory - Room 355
Speaker:Jerry Shen


Topic:A talk on Difficult Integer Programs Arising from Combinatorial Problems
Time:Tuesday 06/01/04 12:00pm - 1:00pm
Place:Mohler Laboratory - Room 355
Lead:Garth Isaak


Introduction:

The overall topic of discussion in this seminar series is General Optimization and Mathematical Programming. The seminars will be completely informal and will be held during the lunch hour 12:00pm - 1:00pm every week (typically on Thursday) as schedules permit. The meetings will be no longer than 60 min and attendees are encouraged to bring their lunch.

If you wish to contribute a talk on your own research in optimization send an email with a short description of your topic to Menal Guzelsoy.

Spring 2004

The plan next semester is to focus, in more detail, on a select number of topics. We have chosen 3 major topics (4 weeks each) and associated subtopics. For those areas "in order of preference", we will likely only get to the first two subtopics (2 weeks each). If you have any suggestions on the topics, subtopics, format or other - send a note. Also, unless there are conflicts, we will stick to Thursdays 12-1 pm.
Previous Sessions
Topic:Clutters, Blockers, Polyhedra
Time:Thursdays 04/15/04, O4/22/04 12:00pm - 1:00pm
Place:Mohler Laboratory - Room 355
Lead:Jeff Linderoth

Suggested Reading:
Laurence A. Wolsey, George L. Nemhauser Integer and Combinatorial Optimization Sections: I.4.5, III.1.4 and III.1.6

Topic:Integer Programming Duality
Time:Thursday 04/08/04 12:00pm - 1:00pm
Place:Mohler Laboratory - Room 355
Lead:Ted Ralphs

Suggested Reading:
Diego Klabjan A New Subadditive Approach to Integer Programming: Theory and Algorithms In Proceedings of the Ninth
Conference on Integer Programming and Combinatorial Optimization, Cambridge, MA, pages 384-400
L.A. Wolsey Integer Programming Duality: Price Functions and Sensitivity AnalaysisMath Programming, 20
Burdet and Johnson A Subadditive Approach to Solve Linear Integer ProgramsAnnals of Discrete Mathematics 1, 1977, p. 117

Topic:Basis Reduction, Test Sets, Group Relaxations
Time:Thursdays 03/04/04 - 04/01/04 12:00pm - 1:00pm
Place:Mohler Laboratory - Room 355
Lead:Ted Ralphs, Jeff Linderoth

Suggested Reading:
Karen Aardal, Robert Weismantel, Laurence Wolsey Non-Standard Approaches to Integer Programming
Discrete Applied Mathematics, Vol 123-1, pp 1-580, 2002
Laurence A. Wolsey, George L. Nemhauser Integer and Combinatorial Optimization

Topic:Large Scale Optimization
Time:Thursdays 01/29/04 - 02/19/04 12:00pm - 1:00pm
Place:Mohler Laboratory - Room 355
Lead:Ted Ralphs

Suggested Reading:
  • Marcus Poggi de Aragao and Eduardo Uchoa Integer Program Reformulation for Robust Branch-and-Cut-and-Price Algorithms November 14, 2003
  • Ricardo Fukasawa, Marcus Poggi de Aragao, Marcelo Reis and Eduardo Uchoa Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
  • P. Cappanera, A. Frangioni Embedding a Bundle Method in Branch and Bound Framework: an Application-Oriented DevelopmentTechnical Report: TR-00-09, Universita Di Pisa, Dipartimento di Informatica,200
  • Carraresi Paolo Frangioni and Antonio Nonato Maddalena Applying Bundle Methods to the Optimization of Polyhedral Functions: An Applications-Oriented Development (1997) Ricerca Operativa Vol. 25 n. 74, p. 5-49, 1996
    		•
  • COIN-OR VOL-FAQS COIN-OR
  • Francisco Barahona and Ranga Anbil The Volume Algorithm: Producing Primal Solutions With a Subgradient Method Technical Paper-IBM

    • Topic:Combinatorial Optimization Topics: Matroids
    Time:Thursdays 10/30/03, 11/06/03 12:00pm - 1:00pm
    Place:Mohler Laboratory - Room 355
    Lead:Garth Isaak

    Suggested Reading:
    W. H. Cunningham Matching, matroids, and extensions. Mathematical Programming Series B 91:515-542, 2002.

    Topic:Robust Optimization
    Time:Thursdays 10/16/03, 10/23/03 12:00pm - 1:00pm
    Place:Mohler Laboratory - Room 355
    Lead:Rosemary Berger

    Suggested Reading:
    J.M. Mulvey, R.J Vanderbei and S.A. Zenios. Robust optimization of large scale systems. Operations Research 43 264-281, 1995.
    A. Ben-Tal, and A. Nemirovski. Robust optimization -- methodology and applications. Mathematical Programming Series B 92:453-480, 2002.
    D. Bertsimas and M. Sim. Robust discrete optimization and network flows. Mathematical Programming Series B 98:49-71, 2003.

    Topic:Cone/Semi-Definite Programming
    Time:Thursdays 09/25/03, 10/02/03 12:00pm - 1:00pm
    Place:Mohler Laboratory - Room 355
    Lead:Jeff Linderoth

    Suggested Reading:
    C. Helmberg, Semidefinite Programming , 2002
    M. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret, Applications of second-order cone programming, 1998
    E. Andersen, C. Roos, T. Terlaky, On implementing a primal-dual interior-point method for conic quadratic optimization, 2000
    L. Lovasz, Semidefinite programs and combinatorial optimization., Lecture Notes, 2000

    Other Suggested Readings: 1 2 3 4 5

    Seminar Schedule:

    Typically sessions will be held on on Thursdays 12:00pm - 1:00pm.

    Calendar View

    Date: Speaker/Lead: Affiliation: Title:
    Fall 2003          
    09/18/03 Thursday 12:00 - 1:00pm Organizational Meeting
    09/25/03 Thursday 12:00 - 1:00pm Jeff Linderoth Cone/Semi-Definite Programming
    10/02/03 Thursday 12:00 - 1:00pm Jeff Linderoth Cone/Semi-Definite Programming
    10/09/03 Thursday 12:00 - 1:00pm Pacing Break
    10/16/03 Thursday 12:00 - 1:00pm Rosemary Berger Robust Optimization
    10/23/03 Thursday 12:00 - 1:00pm Rosemary Berger Robust Optimization
    10/30/03 Thursday 12:00 - 1:00pm Garth Isaak Combinatorial Optimization Topics: Matroids
    11/06/03 Thursday 12:00 - 1:00pm Garth Isaak Combinatorial Optimization Topics: Matroids
    11/13/03 Thursday 12:00 - 1:00pm Ted Ralphs Global Optimization
    11/20/03 Thursday 12:00 - 1:00pm Ted Ralphs Global Optimization
    11/27/03 Thursday 12:00 - 1:00pm Thanksgiving Break
    12/04/03 Thursday 12:00 - 1:00pm TBA
               
    Spring 2003          
    01/30/03 Thursday 12:00 - 1:00pm Francis Vasko Kutztown Math/CIS Using a GA Approach to Schedule a Meltshop in the Steel Industry
               
    Fall 2002          
    09/11/02 Wednesday 12:00 - 1:00pm Ted Ralphs Lehigh ISE A New Framework for Scalable Parallel Tree Search
    09/19/02 Thursday 12:00 - 1:00pm Jeff Linderoth Lehigh ISE Solving Stochastic Optimization Problems on Computational Grids
    09/26/02 Thursday 12:00 - 1:00pm Garth Isaak Lehigh Math Using an IP Formulation to Solve a Problem in Tournament Ranking
    10/03/02 Thursday       Pacing Break
    10/10/02 Thursday 12:00 - 1:00pm Rosemary Berger Lehigh ISE Long Distance Access Network Design
    10/18/02 Friday* 01:30 - 2:30pm Jon Lee IBM Research An Integer-Programming Approach to the "all_different" Predicate
    10/25/02 Friday* 01:30 - 2:30pm Francisco Barahona IBM Research Network Reinforcement
    10/31/02 Thursday 12:00 - 1:00pm Mayuresh Kothare Lehigh ChemE Linear Matrix Inequalities in Systems and Control
    11/07/02 Thursday 12:00 - 1:00pm Gary Gordon Lafayette Math Optimal Rooted Graphs and Expected Value
    11/14/02 Thursday 12:00 - 1:00pm Huseyin Topaloglu Cornell ORIE Dynamic Programming Approximations for the Dynamic Fleet Management Problem
    11/21/02 Thursday 12:00 - 1:00pm Joao Goncalves Lehigh ISE Preliminary Results of Some Extensions to Von Neuman's LP Algorithm
    11/28/02 Thursday       Thanksgiving Break
    12/06/02 Friday* 01:30 - 2:30pm Daniel Bienstock Columbia IEOR Lifting Algorithms for 0-1 Integer Programming

      * ISE Seminar Series

    Information Links:

    Optimization Software

    Integer Programming Other

    Organizers: Ted Ralphs <tkr2@lehigh.edu>, Matthew Galati <magh@lehigh.edu>, Jeff Linderoth <jtl3@lehigh.edu>, Menal Guzelsoy <megb@lehigh.edu>

    Last Updated: July 03, 2004 04:57pm