2014
2014: IPCO XVII in Bonn, Germany Website Program Commitee: Flavia Bonomo (Universidad de Buenos Aires) Sam Burer (University of Iowa) Gerard Cornuejols (Carnegie Mellon University) Satoru Fujishige (Kyoto University) Michael Juenger (Universitaet zu Koeln) Matthias Koeppe (University of California, Davis) Jon Lee, chair (University of Michigan) Jeff Linderoth (University of Wisconsin) Jean-Philippe Richard (University of Florida) Andras Sebo (CNRS, Laboratoire G-SCOP, Grenoble) Maxim Sviridenko (University of Warwick) Chaitanya Swamy (University of Waterloo) Jens Vygen (Universitaet Bonn) David P. Williamson (Cornell University) Laurence Wolsey (Universite catholique de Louvain) Accepted Papers: Ilan Adler, Christos Papadimitriou, and Aviad Rubinstein. On simplex pivoting rules and complexity theory. Volker Kaibel and Matthias Walter. Simple extensions of polytopes. Zachary Friggstad, Jochen Konemann, Young Kun Ko, Anand Louis, Mohammad Shadravan, and Madhur Tulsiani. Linear programming hierarchies suffice for directed Steiner tree. Chandra Chekuri and Alina Ene. The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Lap Chi Lau and Hong Zhou. A unified algorithm for degree bounded survivable network design. Sylvia Boyd, Yao Fu, and Yu Sun. A 5/4-approximation for subcubic 2EC using circulations. Michele Conforti, Alberto Del Pia, Marco Di Summa, and Yuri Faenza. Reverse split rank. Gennadiy Averkov and Amitabh Basu. On the unique-lifting property. Santanu S. Dey, Marco Molinaro, and Qianyi Wang. How good are sparse cutting-planes? Jose R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Victor Verdugo, and Jose Verschae. Strong LP formulations for scheduling splittable jobs on unrelated machines. Matthias Mnich and Andreas Wiese. Scheduling and fixed-parameter tractability. Chien-Chung Huang and Telikepalli Kavitha. An improved approximation algorithm for the stable marriage problem with one-sided ties. Ahmad Abdi and Bertrand Guenin. The cycling property for the clutter of odd st-walks. Henning Bruhn and Oliver Schaudt. Claw-free t-perfect graphs can be recognised in polynomial time. Uriel Feige, R. Ravi, and Mohit Singh. Short tours through large linear forests. Pierre Bonami and Francois Margot. Cut generation through binarization. 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. 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. Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, and Ola Svensson. On the configuration LP for maximum budgeted allocation. Madhukar Korupolu, Adam Meyerson, Rajmohan Rajaraman, and Brian Tagiku. Coupled and k-sided placements: generalizing generalized assignment. Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, and Ola Svensson. Centrality of trees for capacitated k-center. Volker Kaibel and Stefan Weltge. Lower bounds on the sizes of integer programs without additional variables. Iskander Aliev, Jesus A. De Loera, and Quentin Louveaux. Integer programs with prescribed number of solutions and a weighted version of Doignon-Bell-Scarf's theorem. Fatma Kilinc-Karzan and Sercan Yildiz. Two-term disjunctions on the second-order cone. Christoph Buchheim and Claudia D'Ambrosio. Box-constrained mixed-integer polynomial optimization using separable underestimators. Diego Pecin, Artur Pessoa, Marcus Poggi, and Eduardo Uchoa. Improved branch-cut-and-price for capacitated vehicle routing. Mourad Baiou and Francisco Barahona. Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs. Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, and Laura Sanita. Finding small stabilizers for unstable graphs. Amit Chakrabarti and Sagar Kale. Submodular maximization meets streaming: matchings, matroids, and more. Nikhil Bansal and Viswanath Nagarajan. On the adaptivity gap of stochastic orienteering. Anand Bhalgat and Sanjeev Khanna. A utility equivalence theorem for concave functions. Umang Bhaskar, Katrina Ligett, and Leonard J. Schulman. Network improvement for equilibrium routing. Natashia Boland, Hadi Charkhgard, and Martin Savelsbergh. The triangle splitting method for biobjective mixed integer programming. Hassene Aissi, A. Ridha Mahjoub, S. Thomas McCormick, and Maurice Queyranne. A strongly polynomial time algorithm for multicriteria global minimum cuts.