We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some ...

The dynamic programming and branch-and-bound approaches are combined to produce a hybrid algorithm for separable discrete mathematical programs. The hybrid algorithm uses linear programming in a novel way to compute bounds ...

The goal of this paper is to determine if the results for dynamic job-shop scheduling problems are affected by the assumptions made with regard to the processing time distributions and the scheduler's knowledge of the ...

Not Available

Accident statistics have often been used to support the argument that an abnormally small proportion of drivers account for a large proportion of the accidents. This paper compares statistics developed from six-year data ...

Inverse optimization refers to the fact that each time a Lagrangean derived from a given mathematical programming problem is solved, it produces an optimal solution to some problem with a different right hand side. This ...