pokutta.com
Projects
http://www.pokutta.com/Homepage/Projects.html
Non-invasive Pregnancy Diagnostics for Predicting Obstructed Labor. SDP Extended Formulations ( NSF-funded - CMMI-1452463. Physical Flow and other Industrial Challenges ( NSF-funded - CCF-1415496. Almost Symmetric Integer Programming ( NSF-funded - CMMI-1333789. Limits of Linear Programming ( NSF-funded - CMMI-1300144. Center on Next Generation Logistics. Non-invasive Pregnancy Diagnostics for Predicting Obstructed Labor. SDP Extended Formulations (. Physical Flow and other Industrial Challenges (.
pokutta.com
Publications
http://www.pokutta.com/Homepage/Publications.html
In preparation / articles pending review. M Bodur, A. Del Pia, S.S. Dey, M. Molinaro, S. Pokutta,. Aggregation-based cutting-planes for packing and covering integer programs. P Le Bodic, J.W. Pavelka, M.E. Pfetsch, S. Pokutta,. Solving MIPs via Scaling-based Augmentation. B Knueven, J. Ostrowski, S.Pokutta,. Detecting Almost Symmetries in Graphs,. G Braun, S. Pokutta. An information diffusion Fano inequality,. R Song, Y. Xie, S. Pokutta,. Sequential information guided sensing. G Braun, S. Pokutta. Strong...
pokutta.com
Bio
http://www.pokutta.com/Homepage/Bio.html
David M. McKenney Family Early Career Professor. University of Duisburg-Essen, Germany, 2003. University of Duisburg-Essen, Germany, 2005. Massachusetts Institute of Technology, 2006. David M. McKenney Family Early Career Professor appointment, 2016. In the H. Milton School of Industrial and Systems Engineering at Georgia Tech. CAREER Award, National Science Foundation, 2015. EGRIE Annual Meeting Best paper award, 2014. Together with N. Gatzert and N. Vogl. Coca Cola Early Career Professorship, 2014.
pokutta.com
People
http://www.pokutta.com/Homepage/People.html
Sebastian Pokutta is the David M. McKenney Family Early Career. Associate Professor in the School of Industrial and Systems Engineering. He received both his Master's degree and his Ph.D. in Mathematics from the University of Duisburg-Essen in Germany. Gábor Braun is a postdoc in Georgia Tech working on lower bounds of complexity of combinatorial problems under various programming paradigms like LPs and SDPs. He have received his Master's degree in Mathematics at Eötvös Loránd University. Program at Geor...
SOCIAL ENGAGEMENT