Cambridge University Press / Advanced Optimization Laboratory / Princeton University Press / Israel Journal / HP / /
Country
United States / Canada / /
Currency
pence / / /
Event
Force Majeure / /
Facility
McMaster University / University of New Brunswick / /
IndustryTerm
simplex algorithm / called tree search problems / transportation polytopes / mpc backtracking software / search tree / candidate solutions / search space / /
Organization
Cambridge University / McMaster University / Faculty of Computer Science / Princeton University / Department of Mathematics / University of New Brunswick / American Mathematical Society / MITACS / Natural Sciences and Engineering Research Council of Canada / /
Person
David W. Walkup / Bernd Sturmfels / Gil Kalai / Michel Las Vergnas / Daniel J. Kleitman / Branko Gr / David Bremner / Volker Kaibel / Thomas Hansen / Thomas Rothvoß / Christophe Weibel / Friedrich Eisenbrand / Uri Zwick / Neil White / Lars Schewe / Shmuel Onn / Francisco Santos / Alexander Razborov / Fred Holt / Paul R. Goodey / William Hua / Edward D. Kim / Anders Bj / Oliver Friedmann / A. De Loera / David Bremner∗ Antoine Deza / Victor Klee / Benjamin Matschke / Marie Curie / / /
Position
Canada Research Chair / General / /
ProvinceOrState
New Jersey / New Brunswick / New York / Ontario / /
PublishedMedium
Bulletin of the American Mathematical Society / Acta Mathematica / Theory of Computing / European Journal of Combinatorics / /
CCCG 2011, Toronto ON, August 10–12, 2011 Pushing the boundaries of polytopal realizability David Bremner∗ Antoine Deza†