Program
Fri - Sun (June 20 - 22) | Summer School (Arithmeum) | |
Sunday (June 22) | 17:00 - 20:00 | On-site registration (Arithmeum) |
18:00 - 21:00 | Welcome reception (Arithmeum) | |
Monday (June 23) | 08:30 - 08:50 | On-site registration (University Club) |
08:50 - 09:00 | Welcome | |
09:00 - 09:30 | Ilan Adler, Christos Papadimitriou, and Aviad Rubinstein: On simplex pivoting rules and complexity theory | |
09:30 - 10:00 | Volker Kaibel and Matthias Walter: Simple extensions of polytopes | |
10:00 - 10:30 | Zachary Friggstad, Jochen Könemann, Young Kun Ko, Anand Louis, Mohammad Shadravan, and Madhur Tulsiani: Linear programming hierarchies suffice for directed Steiner tree | |
10:30 - 11:00 | Coffee break | |
11:00 - 11:30 | Chandra Chekuri and Alina Ene: The all-or-nothing flow problem in directed graphs with symmetric demand pairs | |
11:30 - 12:00 | Lap Chi Lau and Hong Zhou: A unified algorithm for degree bounded survivable network design | |
12:00 - 12:30 | Sylvia Boyd, Yao Fu, and Yu Sun: A 5/4-approximation for subcubic 2EC using circulations | |
12:30 - 14:00 | Lunch break | |
14:00 - 14:30 | Michele Conforti, Alberto Del Pia, Marco Di Summa, and Yuri Faenza: Reverse split rank | |
14:30 - 15:00 | Gennadiy Averkov and Amitabh Basu: On the unique-lifting property | |
15:00 - 15:30 | Santanu S. Dey, Marco Molinaro, and Qianyi Wang: How good are sparse cutting-planes? | |
15:30 - 16:00 | Coffee break | |
16:00 - 16:30 | José R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Víctor Verdugo, and José Verschae: Strong LP formulations for scheduling splittable jobs on unrelated machines | |
16:30 - 17:00 | Matthias Mnich and Andreas Wiese: Scheduling and fixed-parameter tractability | |
17:00 - 17:30 | Chien-Chung Huang and Telikepalli Kavitha: An improved approximation algorithm for the stable marriage problem with one-sided ties | |
18:00 - 19:00 | Arithmeum tour | |
Tuesday (June 24) | 09:00 - 09:30 | Ahmad Abdi and Bertrand Guenin: The cycling property for the clutter of odd st-walks |
09:30 - 10:00 | Henning Bruhn and Oliver Schaudt: Claw-free t-perfect graphs can be recognised in polynomial time | |
10:00 - 10:30 | Uriel Feige, R. Ravi, and Mohit Singh: Short tours through large linear forests | |
10:30 - 11:00 | Coffee break | |
11:00 - 11:30 | Pierre Bonami and François Margot: Cut generation through binarization | |
11:30 - 12:00 | Manish Bansal and Kiavash Kianfar: n-step cycle inequalities: facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem | |
12:00 - 12:30 | Alejandro Angulo, Daniel Espinoza, and Rodrigo Palma: Sequence independent, simultaneous and multidimensional lifting of generalized flow covers for the semi-continuous knapsack problem with generalized upper bounds constraints | |
12:30 - 13:00 | Poster Session | |
12:30 - 14:00 | Lunch break | |
14:00 - 14:30 | Christos Kalaitzis, Aleksander Mądry, Alantha Newman, Lukáš Poláček, and Ola Svensson: On the configuration LP for maximum budgeted allocation | |
14:30 - 15:00 | Madhukar Korupolu, Adam Meyerson, Rajmohan Rajaraman, and Brian Tagiku: Coupled and k-sided placements: generalizing generalized assignment | |
15:00 - 15:30 | Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, and Ola Svensson: Centrality of trees for capacitated k-center | |
15:30 - 16:00 | Coffee break | |
16:00 - 16:30 | Volker Kaibel and Stefan Weltge: Lower bounds on the sizes of integer programs without additional variables | |
16:30 - 17:00 | Iskander Aliev, Jesús A. De Loera, and Quentin Louveaux: Integer programs with prescribed number of solutions and a weighted version of Doignon-Bell-Scarf's theorem | |
17:00 - 17:30 | Poster Session | |
18:00 - 23:00 | Boat trip with conference dinner (Rhine river) | |
Wednesday (June 25) | 09:00 - 09:30 | Fatma Kılınç-Karzan and Sercan Yıldız: Two-term disjunctions on the second-order cone |
09:30 - 10:00 | Christoph Buchheim and Claudia D'Ambrosio: Box-constrained mixed-integer polynomial optimization using separable underestimators | |
10:00 - 10:30 | Diego Pecin, Artur Pessoa, Marcus Poggi, and Eduardo Uchoa: Improved branch-cut-and-price for capacitated vehicle routing | |
10:30 - 11:00 | Coffee break | |
11:00 - 11:30 | Mourad Baïou and Francisco Barahona: Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs | |
11:30 - 12:00 | Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, and Laura Sanità: Finding small stabilizers for unstable graphs | |
12:00 - 12:30 | Amit Chakrabarti and Sagar Kale: Submodular maximization meets streaming: matchings, matroids, and more | |
12:30 - 14:00 | Lunch break | |
14:00 - 14:30 | Nikhil Bansal and Viswanath Nagarajan: On the adaptivity gap of stochastic orienteering | |
14:30 - 15:00 | Anand Bhalgat and Sanjeev Khanna: A utility equivalence theorem for concave functions | |
15:00 - 15:30 | Umang Bhaskar, Katrina Ligett, and Leonard J. Schulman: Network improvement for equilibrium routing | |
15:30 - 16:00 | Coffee break | |
16:00 - 16:30 | Natashia Boland, Hadi Charkhgard, and Martin Savelsbergh: The triangle splitting method for biobjective mixed integer programming | |
16:30 - 17:00 | Hassene Aissi, A. Ridha Mahjoub, S. Thomas McCormick, and Maurice Queyranne: A strongly polynomial time algorithm for multicriteria global minimum cuts |
The welcome reception on Sunday (as well as the Summer School from Friday to Sunday) will take place in the Arithmeum.
All IPCO sessions and coffee breaks (from Monday to Wednesday) will take place in the University Club. See Local Information for details.