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 Guenin | The cycling property for odd st-walk clutters |
| Ilan Adler, Christos Papadimitriou and Aviad Rubinstein | On simplex pivoting rules and complexity theory |
| Hassene Aissi, Ridha Mahjoub, S. Thomas McCormick and Maurice Queyranne | A strongly polynomial time algorithm for multicriteria global minimum cuts |
| Iskander Aliev, Jesus De Loera and Quentin Louveaux | Integer 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 Svensson | Centrality 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 Basu | On the unique-lifting property |
| Mourad Baiou and Francisco Barahona | Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs |
| 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 |
| 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 |
| Adrian Bock, Karthekeyan Chandrasekaran, Jochen Koenemann, Britta Peis and Laura Sanita | Finding small stabilizers for unstable graphs |
| Natashia Boland, Hadi Charkhgard and Martin Savelsbergh | Triangle splitting method for biobjective mixed integer programming |
| Pierre Bonami and Francois Margot | Cut generation through binarization |
| Sylvia Boyd, Yao Fu and Yu Sun | A 5/4-approximation algorithm for subcubic 2EC using circulations |
| Christoph Buchheim and Claudia D'Ambrosio | Box-constrained mixed-integer polynomial optimization using separable underestimators |
| Amit Chakrabarti and Sagar Kale | Submodular maximization meets streaming: matchings, matroids, and more |
| Chandra Chekuri and Alina Ene | The all-or-nothing flow problem in directed graphs with symmetric demand pairs |
| Michele Conforti, Alberto Del Pia, Marco Di Summa and Yuri Faenza | Reverse split rank |
| Jose Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Ola Svensson, Leen Stougie, Víctor Verdugo and José Verschae | Strong LP formulations for scheduling splittable jobs on unrelated machines |
| Santanu Dey, Marco Molinaro and Qianyi Wang | How good are sparse cutting-planes? |
| Uriel Feige, R. Ravi and Mohit Singh | Short tours through large linear forests |
| Zachary Friggstad, Jochen Koenemann and Mohammad Shadravan | Linear programming hierarchies suffice for directed Steiner tree |
| Chien-Chung Huang and Telikepalli Kavitha | An improved approximation algorithm for the stable marriage problem with one-sided ties |
| Volker Kaibel and Matthias Walter | Simple extensions of polytopes |
| Volker Kaibel and Stefan Weltge | Lower bounds on the sizes of integer programs without additional variables |
| Christos Kalaitzis, Aleksander Mądry, Alantha Newman, Lukáš Poláček and Ola Svensson | On the configuration LP for maximum budgeted allocation |
| Fatma Kilinc Karzan and Sercan Yildiz | Two-term disjunctions for conic sets |
| Madhukar Korupolu, Adam Meyerson, Rajmohan Rajaraman and Brian Tagiku | Coupled and k-sided placements: generalizing generalized assignment |
| Lap Chi Lau and Hong Zhou | A unified algorithm for degree bounded survivable network design |
| Matthias Mnich and Andreas Wiese | Scheduling meets fixed-parameter tractability |
| Diego Pecin, Artur Pessoa, Marcus Poggi and Eduardo Uchoa | Improved branch-cut-and-price for capacitated vehicle routing |
| Oliver Schaudt and Henning Bruhn | Claw-free t-perfect graphs can be recognised in polynomial time |