|
-
Program != Program: Constraint Programming and Its Relationship to Mathematical Programming - Dr. Irv Lustig
Presented by ILOG Optimization Evangelist Dr. Irv Lustig, this 30-minute long presentation covers how constraint programming is an alternative and complementary method to mathematical programming for solving optimization problems.
-
Semidefinite Relaxations for Hard Combinatorial Problems - Henry Wolkowicz
Semidefinite Programming is currently a very exciting and active area of
research.
Semidefinite relaxations generally provide very
tight bounds for many
classes of numerically hard problems.
In addition, these relaxations can be
solved efficiently by interior-point methods.
In this paper we study these semidefinite relaxations
using the equivalent Lagrangian relaxations.
In particular, the theme of the paper is to show that the Lagrangian
relaxation is, in some respects, best. In all instances we consider,
we show that whenever we have a
tractable bound (relaxation), then the same bound can be obtained from a
Lagrangian relaxation.
-
Optimization Models for Truckload Motor Carriers - W.B. Powell
This talk illustrates the use of optimization models for strategic, tactical and operational planning in the truckload
motor carrier industry. Designed for a general audience, the talk highlights the modeling issues that arise in this
classic resource allocation problem.
|