Conference Program


Sunday (June 25) 6:00 (pm) Reception
[QNC 1101]
Monday (June 26) 8:30 Breakfast
8:50 Welcome and opening remarks
9:00 Mixed-integer convex representability
Lubin, Zadik and Vielma
9:30 On the notions of facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem
Koeppe and Zhou
10:00 Minimum Birkhoff-von Neumann decomposition
Kulkarni, Lee and Singh
10:30 Coffee Break
11:00 Online matroid intersection: Beating half for random arrival
Guruganesh and Singla
11:30 Maximum matching in the online batch-arrival model
Lee and Singla
12:00 Long term behavior of dynamic equilibriain fluid queuing networks
Cominetti, Correa and Olver
12:30 Lunch Break
2:00 Integrality gaps of integer knapsack problems
Aliev, Henk and Oertel
2:30 An improved integrality gap for the Calinescu-Karloff-Rabani relaxation for multiway cut
Angelidakis, Makarychev and Manurangsi
3:00 Deterministic discrepancy minimization via the multiplicative weight update method
Levy, Ramadas and Rothvoss
3:30 Coffee Break
4:00 Min-max theorems for packing and covering odd (u,v)-trails
Ibrahimpur and Swamy
4:30 Enumeration of integer points in projections of unbounded polyhedra
Nguyen and Pak
5:00 Mixed-integer linear representability, disjunctions, and variable elimination
Basu, Martin, Ryan and Wang
5:30 The two-point Fano and ideal binary clutters
Abdi and Guenin
6:00 Poster Session
Tuesday (June 27) 8:30 Breakfast
9:00 Optimal t-matchings excluding prescribed t-factors in bipartite graphs: A unified framework for nonbipartite matchings and restricted 2-matchings
Takazawa
9:30 An improved deterministic rescaling for linear programming algorithms
Hoberg and Rothvoss
10:00 A 4/5-approximation algorithm for the maximum traveling salesman problem
Dudycz, Marcinkowski, Paluch, Rybicki
10:30 Coffee Break
11:00 The heterogeneous capacitated k-center problem
Chakrabarty, Krishnaswamy, Kumar
11:30 A quasi-polynomial approximation for the restricted assignment problem
Jansen and Rohwedder
12:00 The salesman's improved tours in fundamental graphs
Boyd and Sebo
12:30 Lunch Break
2:00 Cutting planes from wide split disjunctions
Bonami, Lodi, Tramontani, Wiese
2:30 The structure of the infinite models in integer programming
Basu, Conforti, Di Summa, Paat
3:00 Verifying integer programming results
Cheung, Gleixner, Steffy
3:30 Coffee Break
4:00 Minimizing multimodular functions and allocating capacity in bike-sharing systems
Freund, Henderson and Shmoys
4:30 Stochastic online scheduling on unrelated machines
Gupta, Moseley, Uetz and Xie
5:00 On scheduling co- flows
Ahmadi, Khuller, Purohit and Yang
5:30 Breaking 1 - 1/e barrier for non-preemptive throughput maximization
Im, Moseley and Li
6:00 Conference Dinner
Wednesday (June 28) 8:30 Breakfast
9:00 Adaptive submodular ranking
Kambadur, Nagarajan and Navidi
9:30 Newton's method for parametric submodular function minimization
Goemans, Gupta and Jaillet
10:00 Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time
Bhattacharya, Chakrabarty and Henzinger
10:30 Coffee Break
11:00 High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and Chvatal-Gomory cuts
Mastrolilli
11:30 Budget feasible mechanisms on matroids
Leonardi, Monaco, Sankowski and Zhang
12:00 Equilibrium computation in atomic splittable singleton congestion games
Timmermans and Harks
12:30 Lunch Break
2:00 Number balancing is as hard as Minkowski's theorem and shortest vector
Hoberg, Ramadas, Rothvoss and Yang
2:30 Constant factor approximations with families of intersection cuts
Averkov, Basu, Paat
3:00 Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
Friggstad and Swamy
3:30 Local guarantees in graph cuts and clustering
Charikar, Gupta, and Schwartz
class="active"

Important Information

The IPCO 2017 proceedings are now online. Thank you to Bill Cook for scanning his copy of the proceedings of IPCO 1990!

All Summer school lectures take place in MC 5501; IPCO talks run in QNC 0101.

Refer to this flyer with useful local information, and annotated maps to find your way on campus as well as for directions to campus from Delta hotel.

Registration is now open.

Promotional rate for airport shuttle is available here (conference code: IPCO 2017)

See here for a list of accepted papers.

Conference:
June 26 - 28, 2017.
Summer school:
June 24 - 25, 2017

IPCO