2017

2017: IPCO XIX in Waterloo, Canada Program Commitee: Nikhil Bansal Gérard Cornuéjols Daniel Dadush Santanu Dey Fritz Eisenbrand, chair Samuel Fiorini Anupam Gupta Satoru Iwata Jochen Koenemann Seffi Naor Kurt Mehlhorn Britta Peis Laura Sanità Laurence Wolsey Rico Zenklusen List of accepted papers: Lubin, Zadik and Vielma. Mixed-integer convex representability. Koeppe and Zhou. On the notions of facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem. Kulkarni, Lee and Singh. Minimum Birkhoff-von Neumann decomposition. Guruganesh and Singla. Online matroid intersection: Beating half for random arrival. Lee and Singla. Maximum matching in the online batch-arrival model. Cominetti, Correa and Olver. Long term behavior of dynamic equilibriain fluid queuing networks. Aliev, Henk and Oertel. Integrality gaps of integer knapsack problems. Angelidakis, Makarychev and Manurangsi. An improved integrality gap for the Calinescu-Karloff-Rabani relaxation for multiway cut. Levy, Ramadas and Rothvoss. Deterministic discrepancy minimization via the multiplicative weight update method. Ibrahimpur and Swamy. Min-max theorems for packing and covering odd (u,v)-trails. Nguyen and Pak. Enumeration of integer points in projections of unbounded polyhedra. Basu, Martin, Ryan and Wang. Mixed-integer linear representability, disjunctions, and variable elimination. Abdi and Guenin. The two-point Fano and ideal binary clutters. Takazawa. Optimal t-matchings excluding prescribed t-factors in bipartite graphs: A unified framework for nonbipartite matchings and restricted 2-matchings. Hoberg and Rothvoss. An improved deterministic rescaling for linear programming algorithms. Dudycz, Marcinkowski, Paluch, Rybicki. A 4/5-approximation algorithm for the maximum traveling salesman problem. Chakrabarty, Krishnaswamy, Kumar. The heterogeneous capacitated k-center problem. Jansen and Rohwedder. A quasi-polynomial approximation for the restricted assignment problem. Boyd and Sebo. The salesman's improved tours in fundamental graphs. Bonami, Lodi, Tramontani, Wiese. Cutting planes from wide split disjunctions. Basu, Conforti, Di Summa, Paat. The structure of the infinite models in integer programming. Cheung, Gleixner, Steffy. Verifying integer programming results. Freund, Henderson and Shmoys. Minimizing multimodular functions and allocating capacity in bike-sharing systems. Gupta, Moseley, Uetz and Xie. Stochastic online scheduling on unrelated machines. Ahmadi, Khuller, Purohit and Yang. On scheduling co-flows. Im, Moseley and Li. Breaking 1 - 1/e barrier for non-preemptive throughput maximization. Kambadur, Nagarajan and Navidi. Adaptive submodular ranking. Goemans, Gupta and Jaillet. Newton's method for parametric submodular function minimization. Bhattacharya, Chakrabarty and Henzinger. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. Mastrolilli. High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and Chvatal-Gomory cuts. Leonardi, Monaco, Sankowski and Zhang. Budget feasible mechanisms on matroids. Timmermans and Harks. Equilibrium computation in atomic splittable singleton congestion games. Hoberg, Ramadas, Rothvoss and Yang. Number balancing is as hard as Minkowski's theorem and shortest vector. Averkov, Basu, Paat. Constant factor approximations with families of intersection cuts. Friggstad and Swamy. Compact, provably-good LPs for orienteering and regret-bounded vehicle routing. Charikar, Gupta, and Schwartz. Local guarantees in graph cuts and clustering.