Time+Place: Tuesday 09/12/2003 14:30 Room 337-8 Taub Bld.
Title: Convex combinatorial optimization
Speaker: Uriel Rothblum
Affiliation: Industrial Engineering and Management, Technion
Host: Johann Makowsky

Abstract:

We introduce the convex combinatorial optimization problem, a far 
reaching generalization of the standard linear combinatorial 
optimization problem. We show that it is strongly polynomial time 
solvable over any edge-guaranteed family, and discuss several 
applications.

Joint work with Shmuel Onn