 |
Center for Nonlinear Studies |
In recent years several developments have emerged from the research community from both a modeling and computer hardware perspective that offer great hope for advancing the adoption of optimization in practice. In this talk we highlight how most combinatorial optimization problems can be reformulated and efficiently solved by first adopting the special unifying modeling framework provided by the quadratic unconstrained binary program. This rather surprising result will be illustrated by a wide variety of examples as we survey both published and unpublished work in this area. *Talk slot is 10:30am-11:30am, and 11:30am-12:00pm is for questions/discussion
Host: Carleton Coffrin