Accepted Papers for IPCO 2014

We received 143 submissions, more than for any previous IPCO.

The program committee has selected the following 34 of them:

Ahmad Abdi and Bertrand GueninThe cycling property for odd st-walk clutters
Ilan Adler, Christos Papadimitriou and Aviad RubinsteinOn simplex pivoting rules and complexity theory
Hassene Aissi, Ridha Mahjoub, S. Thomas McCormick and Maurice QueyranneA strongly polynomial time algorithm for multicriteria global minimum cuts
Iskander Aliev, Jesus De Loera and Quentin LouveauxInteger programs with prescribed number of solutions and a weighted version of Doignon-Bell-Scarf theorem
Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan and Ola SvenssonCentrality of trees for capacitated k-center
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
Gennadiy Averkov and Amitabh BasuOn the unique-lifting property
Mourad Baiou and Francisco BarahonaMaximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
Manish Bansal and Kiavash Kianfarn-step cycle inequalities: facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem
Nikhil Bansal and Viswanath NagarajanOn the adaptivity gap of stochastic orienteering
Anand Bhalgat and Sanjeev KhannaA utility equivalence theorem for concave functions
Umang Bhaskar, Katrina Ligett and Leonard J. SchulmanNetwork improvement for equilibrium routing
Adrian Bock, Karthekeyan Chandrasekaran, Jochen Koenemann, Britta Peis and Laura SanitaFinding small stabilizers for unstable graphs
Natashia Boland, Hadi Charkhgard and Martin SavelsberghTriangle splitting method for biobjective mixed integer programming
Pierre Bonami and Francois MargotCut generation through binarization
Sylvia Boyd, Yao Fu and Yu SunA 5/4-approximation algorithm for subcubic 2EC using circulations
Christoph Buchheim and Claudia D'AmbrosioBox-constrained mixed-integer polynomial optimization using separable underestimators
Amit Chakrabarti and Sagar KaleSubmodular maximization meets streaming: matchings, matroids, and more
Chandra Chekuri and Alina EneThe all-or-nothing flow problem in directed graphs with symmetric demand pairs
Michele Conforti, Alberto Del Pia, Marco Di Summa and Yuri FaenzaReverse split rank
Jose Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Ola Svensson, Leen Stougie, Víctor Verdugo and José VerschaeStrong LP formulations for scheduling splittable jobs on unrelated machines
Santanu Dey, Marco Molinaro and Qianyi WangHow good are sparse cutting-planes?
Uriel Feige, R. Ravi and Mohit SinghShort tours through large linear forests
Zachary Friggstad, Jochen Koenemann and Mohammad ShadravanLinear programming hierarchies suffice for directed Steiner tree
Chien-Chung Huang and Telikepalli KavithaAn improved approximation algorithm for the stable marriage problem with one-sided ties
Volker Kaibel and Matthias WalterSimple extensions of polytopes
Volker Kaibel and Stefan WeltgeLower bounds on the sizes of integer programs without additional variables
Christos Kalaitzis, Aleksander Mądry, Alantha Newman, Lukáš Poláček and Ola SvenssonOn the configuration LP for maximum budgeted allocation
Fatma Kilinc Karzan and Sercan YildizTwo-term disjunctions for conic sets
Madhukar Korupolu, Adam Meyerson, Rajmohan Rajaraman and Brian TagikuCoupled and k-sided placements: generalizing generalized assignment
Lap Chi Lau and Hong ZhouA unified algorithm for degree bounded survivable network design
Matthias Mnich and Andreas WieseScheduling meets fixed-parameter tractability
Diego Pecin, Artur Pessoa, Marcus Poggi and Eduardo UchoaImproved branch-cut-and-price for capacitated vehicle routing
Oliver Schaudt and Henning BruhnClaw-free t-perfect graphs can be recognised in polynomial time