Wednesday, August 19
7:30-8:50 Registration and breakfast
8:50-9:00 Opening remarks (Tamás Terlaky)
9:00-10:00 Natalia Alexandrov, NASA Langley Research Center
|
10:00-10:30 Coffee break
10:30-12:00 Parallel technical sessions
Applications Chair: Suriya Ruangpattana |
Geometric aspects of optimization Chair: Serge Kruk |
Strategic Planning: OR to the Rescue Francis J. Vasko, Kutztown University |
Face Lattice Computation Under Symmetry Adrian Burlacu, McMaster University |
Application of Optimization to the Design of a Predictive Controller with Variable Time Switches Kaska Kowalska, McMaster University |
Recent progress on the polytope diameter bounds David Bremner, University of New Brunswick |
Motion Analysis and Modeling in Image-Guided Radiation Therapy Olesya Peshko, McMaster University |
Self-correcting geometry in model based derivative-free optimization Katya Scheinberg, Columbia University |
12:00-13:00 Lunch
13:00-14:30 Parallel technical sessions
Distribution networks Chair: Larry Snyder |
Semidefinite programming and its applications Chair: Hayato Waki |
Warehouse-Retailer Network Design: New Formulation and Approximation Algorithm Xi Wang and Jiawei Zhang, New York University |
Shape-constrained spline estimation of multivariate functions using semidefinite programming David Papp, Rutgers Center for Operations Research |
A new efficient heursitic for the design and analysis of distribution systems Zumbul Bulut, Lehigh University |
New Relaxation Schemes for Polynomial Programing Juan Vera, University of Waterloo |
A tree-based model for redundant multicast routing problem with shared risk link group diverse constraints Wanpracha Art Chaovalitwongse, Rutgers University |
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem Selin D. Ahipasaoglu, Cornell University |
14:30-15:00 Coffee break
15:00-16:30 Parallel technical sessions
Financial optimization Chair: Aurélie Thiele |
Algorithms Chair: Frank Curtis |
Constant Rebalanced Portfolio Optimization under Nonlinear Transaction Costs Yuichi Takano, University of Tsukuba |
The harmony search algorithm Zong Woo Geem, Johns Hopkins University |
Log-robust portfolio management Ban Kawas, Lehigh University |
On-line bin covering algorithms Pall Jensson, University of Iceland |
Fractional Brownian motion and optimization by ellipsoids Vladimir Dobric, Lehigh University |
Level set methods for finding critical points of mountain pass type C.H. Jeffrey, Pang, Fields Institute |
16:30-16:45 Break
16:45-17:45 John M. Mulvey, Princeton University
|
18:30-21:30 Student social, Graduate Student Center
Thursday, August 20
8:00-9:00 Ravindra K. Ahuja, University of Florida, Gainesville
|
9:00-9:15 Break
9:15-10:45 Parallel technical sessions
Mixed-integer NLP Chair: Pietro Belotti |
Energy Chair: Suriya Ruangpattana |
Extending SCIP for MINLP Stefan Vigerske, Humboldt University Berlin |
Formulations for the Unit Commitment Problem Jim Ostrowski, University of Waterloo |
Mixed Integer Bilevel Programming Ted Ralphs, Lehigh University |
Cancelled |
Parametric nonlinear discrete optimization Jon Lee, IBM Research |
Optimal Division of the Load Duration Curve for Managing Fuel Diversification Suriya Ruangpattana, Purdue University |
10:45-11:15 Coffee break
11:15-12:45 AIMMS-CPLEX/MOPTA Optimization Modeling Competition Final
The three finalists are
AIMMS-CPLEX/MOPTA Optimization Modeling Competition Final |
Team Konrad’s Truckers, Zuse Institute, Berlin, Germany
Stefan Heinz, Jonas Schweiger, Thomas Schlechte, Advisor: Rüdiger Stephan |
Team Twente, University of Twente, The Netherlands
Ruben Hoeksma, Arjan Thomas, Erik-Jan Krijgsman, Advisor: Jacob Jan Paulus |
Team SMU, Southern Methodist University, Dallas, TX, USA
T. Jason Kratz, Angelika Leskovskaya, Ron Dearing, Advisor: Dick Barr |
See the competition page for technical details. The winner will be announced at the conference banquet. Also, see the AIMMS session on Friday for an official solution of the problem.
12:45-13:45 Lunch
13:45-15:15 Parallel technical sessions
Nonlinear programming Chair: C. H. Jeffrey Pang |
Discrete optimization Chair: Ted Ralphs |
Mathematical programming is Turing-complete Leo Liberti, Ecole Polytechnique, LIX |
On mixing inequalities: rank, closure and cutting plane proofs Oktay Gunluk, IBM Research |
Network Equilibrium Problems and Hybrid Dynamical Systems Scott Greenhalgh, University of Guelph |
The master equality polyhedron Sanjeeb Dash, IBM Research |
Entropic optimization: a novel framework for optimization/decision making under uncertainty Eugene Perevalov, Lehigh University |
Facets of multiple all-different constraints Serge Kruk, Oakland University |
15:15-15:45 Coffee break
15:45-16:45 Panel discussion
Trends: the future of computational optimization and software |
Ravindra Ahuja, University of Florida, Gainesville |
Natalia Alexandrov, NASA Langley Research Center |
Gertjan de Lange, Paragon Decision Technology |
Jon Lee, IBM Research |
Irv Lustig, ILOG |
Tamás Terlaky, Lehigh University (moderator) |
16:45-17:45 Pablo A. Parrilo, Massachusetts Institute of Technology
|
18:30-21:30 Conference banquet, Banana Factory
Friday, August 21
8:00-9:00 Robert Weismantel, Otto-von-Guericke Universität Magdeburg
|
9:00-9:15 Break
9:15-10:45 Parallel technical sessions
Software Chair: Stefan Vigerske |
Supply chains and pricing Chair: Larry Snyder |
Choosing your own adventure: Automatic taxonomy expansion to permit many paths Xiaoguang Qi, Dawei Yin, Zhenzhen Xue, Brian D. Davison, Computer Science & Engineering, Lehigh University |
Pricing with Markups under Horizontal and Vertical Competition Roger Lederman, Columbia Business School |
The flexibility of the constraint integer programming solver SCIP Stefan Heinz, Zuse Institute Berlin |
Distributing the Inter-Pool Moves and Asset Replacement in the Car Rental Business Gen-Han Wu, The Pennsylvania State University |
Bigger, Better, Faster: update on Cbc, the world’s fastest open-source MIP solver Laszlo Ladanyi, IBM Research |
A Network Optimization Model for a Candy Supply Chain Lawrence V. Snyder and Zeliha Akca, Lehigh University |
10:45-11:15 Coffe break
11:15-12:45 Parallel technical sessions
AIMMS tutorial and demonstration Chair: Imre Pólik |
Interior-point methods Chair: Tamás Terlaky |
Basics Gertjan de Lange, Peter Nieuwesteeg, Paragon Decision Technology |
Full-Newton step polynomial-time methods for LO based on locally self-concordant barrier functions Kees Roos, TU Delft |
AIMMS-CPLEX/MOPTA Optimization Modeling competition solution Gertjan de Lange, Peter Nieuwesteeg, Paragon Decision Technology |
Primal-dual Interior Point Algorithms for LCPs with Arbitrary Matrices Marianna Nagy, Eötvös Loránd University of Sciences, Budapest |
Case studies Gertjan de Lange, Peter Nieuwesteeg, Paragon Decision Technology |
Strange Behaviors of Interior-point Methods for Solving Semidefinite Programming Problems in Polynomial Optimization Hayato Waki, The University of Electro-Communications |
12:45-13:45 Lunch
13:45-15:15 Parallel technical sessions
Multiobjective and nonsmooth optimization Chair: Robert Weismantel |
Simulation and modeling Chair: Ben Felzer |
A Sequential Quadratic Programming Method for Nonsmooth Optimization Frank Curtis, Lehigh University |
Modeling of Birth Seasonality in Canada and the Provinces Arzu Sardarli, First Nations University of Canada |
Multiobjective Optimization via Parametric Programming: Algorithms and Applications Oleksandr Romanko, McMaster University |
Stochastic Sequencing and Scheduling of an Operating Room Camilo Mancilla, Lehigh University |
Allocation of Overlapping Inventory in Online Advertising via MultiObjective Optimization John A. Tomlin, Yahoo! Labs |
Using NCAR CCSM3 to Explore how Future Environmental Stresses to Plant Physiology Affect the Ocean’s Global ‘Conveyor Belt’ Benjamin S. Felzer and Kristian M. Douma, Lehigh University |
15:15-15:30 Break
15:30-16:30 Paul I. Barton, Massachusetts Institute of Technology
|