How does one find the shortest way to travel between a collection of cities? Or the most valuable subgroup of some items that can fit in a knapsack?
Discrete optimization, which lies at the intersection of mathematics and computer science, is the study of such problems where the goal is to select a minimum cost alternative from a finite (or countable) set of alternatives. In this talk, I will discuss a few applications of Discrete Optimization to real-world problems dealing with ports, pipelines, steel plants, shipping, and food distribution. The details of these applications are taken from work done at IBM Research for customers of IBM. Some of the recent advances in Discrete Optimization depend fundamentally on powerful computing platforms and software and also on nontrivial mathematical ideas, and I will briefly touch upon some of these developments.
Affiliation: IBM T. J. Watson Research Center, New York.
Bio: Sanjeeb Dash is a researcher at the Mathematical Sciences Department of the IBM T. J. Watson Research Center. He works on various aspects of Discrete Optimization, including real-life applications for customers of IBM. The focus of his research is Integer Programming and Linear Programming. He has co-authored the QSopt and QSopt_ex linear programming solvers.