Spring 2005 Seminar Series

DATE: Thursday, March 31, 2005
LOCATION: E40-298
TIME: 4:15pm
Reception immediately following in the Philip M. Morse Reading Room, E40-106

SPEAKER:
Uriel G. Rothblum
William Davidson Faculty of Industrial Engineering and Management
Technion

TITLE
Convex Combinatorial Optimization

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.