Optimization and Discrete Geometry : Theory and Practice
24-26 April, 2018
Tel Aviv University, Israel

Tuesday, April 24

09h30 - 10h00 Reception/Coffee/Opening remarks
10h00 - 12h00 Session A1
A11Discrete Geometry meets Machine Learning
Amitabh Basu (Johns Hopkins University)
A12Integer Programming in Strongly Polynomial Oracle Time
Shmuel Onn (Technion)
A13Emulating the Expert: Inverse Optimization through Online Learning
Sebastian Pokutta (Georgia Tech)
A14Easier derivation of bounded pitch inequalities for set covering problems
Daniel Bienstock (Columbia University)
12h00 - 13h30 Lunch
13h30 - 15h00 Session A2
A21Online Algorithms for Non-Linear Optimization
Nguyễn Kim Thắng (Université d’Evry)
A22Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Action and Scalar State
Nir Halman (Hebrew University)
A23Computing nucleolus for cooperative matching games
Kanstantsin Pashkovich (University of California, Berkeley)
15h00 - 15h30 Coffee
15h30 - 17h00 Session A3
A31Block partitions of sequences
Imre Bárány (Alfréd Rényi Mathematical Institute)
A32An invariant and effective description of compact non-convex polyhedra
Dmitrii Pasechnik (University of Oxford)
A33On finite totally separable translative packings
Károly Bezdek (University of Calgary)

Wednesday, April 25

09h30 - 10h00 Reception/Coffee
10h00 - 12h00 Session B1
B11Optimization with verification oracles
Sergei Chubanov (University of Siegen)
B12Disjunctive conic cuts: the good, the bad, and implementation
Julio Góez (Norwegian School of Economics)
B13Barvinok's naive algorithm for dimensionality reduction
Leo Liberti (CNRS & Ecole Polytechnique)
B14Elections, bribery, and integer programming
Martin Koutecký (Technion)
12h00 - 13h30 Lunch
13h30 - 15h00 Session B2
B21Optimization Problems with Sparsity-Inducing Terms
Amir Beck (Tel Aviv University)
B22More Virtuous Smoothing
Jon Lee (University of Michigan)
B23First Order Methods for Solving Convex Bi-Level Optimization Problems
Shoham Sabach (Technion)
15h00 - 15h30 Coffee
15h30 - 17h30 Session B3
B31On Moser's shadow problem
Arnau Padrol (Sorbonne Université)
B32Circuit Walks in Integral Polyhedra
Steffen Borgwardt (University of Colorado Denver)
B33The Simplex Method for LP and the Length of a Path
Shinji Mizuno (Tokyo Institute of Technology)
B34Discrete geometry of functional equations in cutgeneratingfunctionology
Matthias Köppe (University of California, Davis)

Thursday, April 26

09h30 - 10h00 Reception/Coffee
10h00 - 12h00 Session C1
C11A New Look at First Order Methods: Lifting the Lipschitz Gradient Continuity Restriction
Marc Teboulle (Tel Aviv University)
C12Total Dual Integrality for Convex, Semidefinite, and Extended Formulations
Levent Tunçel (University of Waterloo)
C13Cardinality-constrained least squares problem for sparse matrices
Santanu Dey (Georgia Tech)
C14Mixed Integer Second Order Cone Optimization (MISOCO): Conic Cuts, Warm Start, and Rounding
Tamás Terlaky (Lehigh University)
12h00 - 13h30 Lunch
13h30 - 15h00 Session C2
C21Treewidth-based Extension Complexity Lower Bounds
Gonzalo Muñoz (Polytechnique Montréal)
C22Ordered sets and their polytopes in mixed-integer optimization
Akshay Gupte (Clemson University)
C23Balas formulation for the union of polytopes is optimal
Yuri Faenza (Columbia University)
15h00 - 15h30 Coffee
15h30 - 17h30 Session C3
C31A Polynomial-Time Approximation Scheme for Sequential Batch-Testing of Series Systems
Danny Segev (University of Haifa)
C32Flexibility of Distributionally Robust Choice Models in Traffic Equilibrium
Selin Ahipasaoglu (Singapore University of Technology and Design)
C33 Handling border constraints in column generation
Axel Parmentier (Ecole Nationale des Ponts et Chaussées)
C34The Maximum Expected Value All-or-Nothing Subset Problem and Extensions
Noam Goldberg (Bar-Ilan University)

Last update: April 26, 2018