Conference program
The conference takes place on EPFL campus. The talks are in the lecture hall ELA 1.
There will be a reception on Tuesday, June 8 at 7pm at the Grand Café du Casino. The conference office opens on Wednesday, June 9 at 8:30.| Wednesday, June 9 | Thursday, June 10 | Friday, June 11 | ||
|---|---|---|---|---|
| Morning session 1 | 09h00-09h30 |
Klaus Jansen and Roberto Solis-Oba. The high multiplicity bin packing problem | Deeparnab Chakrabarty, Elyot Grant and Jochen Konemann. On Column-restricted and Priority Covering Integer Programs | Andreas Bley and Jose Neto. Approximability of 3- and 4-hop bounded disjoint paths problems |
09h30-10h00 |
James Luedtke. An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs | Daniel Bienstock and Mark Zuckerberg. Solving LP relaxations of large precedence-constrained problems | Sebastian Pokutta and Andreas S. Schulz. On the rank of cutting-plane proof systems | |
10h00-10h30 |
Samuel Fiorini, Gwenaël Joret and Ugo Pietropaoli. Hitting Diamonds and Growing Cacti | Deeparnab Chakrabarty, Jochen Konemann and David Pritchard. Hypergraphic LP Relaxations for Steiner Trees | Kristóf Bérczi and László A. Végh. Restricted b-Matchings In Degree-Bounded Graphs | |
10h30-11h00 |
Coffee break | Coffee break | Coffee break | |
| Morning session 2 | 11h00-11h30 |
Rene Sitters. Efficient algorithms for average completion time scheduling | Jaroslaw Byrka, Aravind Srinivasan and Chaitanya Swamy. Fault-Tolerant Facility Location, a randomized dependent LP-rounding algorithm | Niv Buchbinder, Kamal Jain and Mohit Singh. Secretary Problems via Linear Programming |
11h30-12h00 |
Siavosh Benabbas and Avner Magen. Extending SDP Integrality gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain | Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julian Mestre, Martin Skutella and Leen Stougie. Universal sequencing on a single machine | Raymond Hemmecke, Matthias Köppe and Robert Weismantel. A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs | |
12h00-12h30 |
Edoardo Amaldi, Claudio Iuliano and Romeo Rizzi. Efficient deterministic algorithms for finding a minimum cycle basis in undirected graphs | Alberto Caprara, Christoph Buchheim and Andrea Lodi. An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming | Daniel Bienstock. Eigenvalue techniques for convex objective, nonconvex optimization problems | |
12h30-13h30 |
Lunch | Lunch | Lunch | |
| Afternoon session 1 | 13h30-14h00 |
Amitabh Basu, Manoel Campelo, Conforti Michele, Gerard Cornuéjols and Giacomo Zambelli. On Lifting Integer Variables in Minimal Inequalities | ||
14h00-14h30 |
Nikhil Bansal, Rohit Khandekar, Jochen Konemann, Viswanath Nagarajan and Britta Peis. On Generalizations of Network Design Problems with Degree Bounds | Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta and Surabhi Jain. A 3-approximation for facility location with uniform capacities | Takuro Fukunaga. Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings | |
14h30-15h00 |
Steve Tyber and Ellis Johnson. A Polyhedral Study of the Mixed Integer Cut | Umang Bhaskar, Lisa Fleischer and Chien-Chung Huang. The Price of Collusion in Series-Parallel Networks | Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Kazuhisa Makino. A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information | |
15h00-15h30 |
Santanu Dey and Juan Pablo Vielma. The Chvatal-Gomory Closure of an Ellipsoid is a Polyhedron | Santanu Dey, Andrea Lodi, Andrea Tramontani and Laurence Wolsey. Experiments With Two Row Tableau Cuts | Adam Letchford. Integer Quadratic Quasi-Polyhedra | |
15h30-16h00 |
Coffee break | Coffee break | ||
| Afternoon session 2 | 16h00-16h30 |
Volker Kaibel and Andreas Loos. Polyhedral Branching Systems | Volker Kaibel, Kanstantsin Pashkovich and Dirk Oliver Theis. Symmetry Matters for Sizes of Extended Formulations | |
16h30-17h00 |
Nikhil Bansal, Nitish Korula, Viswanath Nagarajan and Aravind Srinivasan. On k-Column Sparse Packing Programs | Lap Chi Lau and Chun Kong Yung. Efficient Edge Splitting and Constrained Edge Splitting | ||
17h00-17h30 |
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz and Zeev Nutov. Prize-Collecting Steiner Network Problems | Kent Andersen and Robert Weismantel. Zero-coefficient cuts | ||
19h00 |
Conference banquet |