| 2010 |
INFORMS Computing Society Prize:
First Place
Winning material:
"Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility", "Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz"
|
|---|
Do you have the best O.R. department in the world? Enter to win the INFORMS Prize and find out.
View these presentations of verifiable O.R. practice success that made a substantial difference in their organizations. Use them in the classroom or to apply lessons learned to your own organization.
Call on INFORMS experts to comment on important news of the day in their expert areas.
