Conference Program

IPCO Conference
East Hall, Central Campus, Department of Mathematics, University of Michigan
Location: East Hall, 530 Church Street
Ann Arbor, MI 48109
530 Church Street (front entrance), 360 views (Back entrance)
Directions: East Hall Google Maps
Lectures held in Auditorium (1324 East Hall), Reception held in South Atrium *signage will be posted

The LNCS proceedings are available here.

(May 22)
8:00 Breakfast and Registration
8:50 Welcome and opening remarks
9:00 Strong mixed-integer programming formulations for trained neural networks
Anderson, Huchette, Tjandraatmadja and Vielma
9:30 The asymmetric traveling salesman path LP has constant integrality ratio
Köhne, Traub and Vygen
10:00 A Generic Exact Solver for Vehicle Routing and Related Problems
Pessoa, Sadykov, Uchoa and Vanderbeck
10:30 Coffee Break
11:00 On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule
Disser and Hopp
11:30 Linear Programming using Limited-Precision Oracles
Steffy and Gleixner
12:00 Lunch Break
2:00 Min-Max Correlation Clustering via MultiCut
Ahmadi, Khuller and Saha
2:30 Improving the Integrality Gap for Multiway Cut
Bérczi, Chandrasekaran, Király and Madan
3:00 A New Contraction Technique with Applications to Congruency-Constrained Cuts
Nägele and Zenklusen
3:30 Coffee Break
4:00 Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
Croce and Scatamacchia
4:30 A Bundle Approach for SDPs with Exact Subgraph Constraints
Gaar and Rendl
5:00 Random projections for quadratic programs over a Euclidean ball
Vu, Poirion, D'Ambrosio and Liberti
5:30 Poster Session and Welcome Reception (Hosted in East Hall South Atrium)
(May 23)
8:30 Breakfast
9:00 Online Submodular Maximization: Beating 1/2 Made Simple
Buchbinder, Feldman, Filmus and Garg
9:30 Approximate Multi-Matroid Intersection via Iterative Refinement
Linhares, Olver, Swamy and Zenklusen
10:00 Tight Approximation Ratio for Minimum Maximal Matching
Dudycz, Lewandowski and Marcinkowski
10:30 Coffee Break
11:00 An Efficient Characterization of Submodular Spanning Tree Games
Koh and Sanità
11:30 Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Toth, Pashkovich and Koenemann
12:00 Lunch Break
2:00 Extended formulations from communication protocols in output-efficient time
Aprile and Faenza
2:30 On perturbation spaces of minimal valid functions: Inverse semigroup theory and equivariant decomposition theorem
Hildebrand, Koeppe and Zhou
3:00 On Compact Representations of Voronoi Cells of Lattices
Hunkenschröder, Reuland and Schymura
3:30 Coffee Break
4:00 A General Framework for Handling Commitment in Online Throughput Maximization
Chen, Eberle, Megow, Schewior and Stein
4:30 The Markovian Price of Information
Gupta, Jiang, Scully and Singla
5:00 An exact algorithm for robust influence maximization
Nannicini, Sartor, Traversi and Wolfler-Calvo
6:30 Conference Banquet at North Quad
(May 24)
8:30 Breakfast
9:00 Identically self-blocking clutters
Abdi, Cornuejols and Lee
9:30 Integer Programming and Incidence Treedepth
Eiben, Ganian, Knop, Ordyniak, Pilipczuk and Wrochna
10:00 Sparsity of integer solutions in the average case
Paat, Oertel and Weismantel
10:30 Coffee Break
11:00 Intersection Cuts for Polynomial Optimization
Bienstock, Chen and Muñoz
11:30 Intersection cuts for factorable MINLP
12:00 Lunch Break
1:30 Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry
Bendotti, Fouilhoux and Rottner
2:00 Fixed-Order Scheduling on Parallel Machines
Bosman, Frascaria, Olver, Sitters and Stougie
2:30 Breaking symmetries to rescue SoS: The case of makespan scheduling
Verdugo and Verschae
3:00 Coffee Break
3:30 L1-sparsity Approximation Bounds for Packing Integer Programs
Chekuri, Quanrud and Torres
4:00 Dynamic Flows with Adaptive Route Choice
Graf and Harks
4:30 Earliest Arrival Transshipments in Networks With Multiple Sinks