IPCO B

35 papers

YearTitle / Authors
2014A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations.
Sylvia C. Boyd, Yao Fu, Yu Sun
2014A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts.
Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
2014A Unified Algorithm for Degree Bounded Survivable Network Design.
Lap Chi Lau, Hong Zhou
2014A Utility Equivalence Theorem for Concave Functions.
Anand Bhalgat, Sanjeev Khanna
2014An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties.
Chien-Chung Huang, Telikepalli Kavitha
2014Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators.
Christoph Buchheim, Claudia D'Ambrosio
2014Centrality of Trees for Capacitated k-Center.
Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson
2014Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time.
Henning Bruhn, Oliver Schaudt
2014Coupled and k-Sided Placements: Generalizing Generalized Assignment.
Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku
2014Cut Generation through Binarization.
Pierre Bonami, François Margot
2014Finding Small Stabilizers for Unstable Graphs.
Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
2014How Good Are Sparse Cutting-Planes?
Santanu S. Dey, Marco Molinaro, Qianyi Wang
2014Improved Branch-Cut-and-Price for Capacitated Vehicle Routing.
Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa
2014Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings
Jon Lee, Jens Vygen
2014Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's Theorem.
Iskander Aliev, Jesús A. De Loera, Quentin Louveaux
2014Linear Programming Hierarchies Suffice for Directed Steiner Tree.
Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani
2014Lower Bounds on the Sizes of Integer Programs without Additional Variables.
Volker Kaibel, Stefan Weltge
2014Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs.
Mourad Baïou, Francisco Barahona
2014Network Improvement for Equilibrium Routing.
Umang Bhaskar, Katrina Ligett, Leonard J. Schulman
2014On Simplex Pivoting Rules and Complexity Theory.
Ilan Adler, Christos H. Papadimitriou, Aviad Rubinstein
2014On the Adaptivity Gap of Stochastic Orienteering.
Nikhil Bansal, Viswanath Nagarajan
2014On the Configuration LP for Maximum Budgeted Allocation.
Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson
2014On the Unique-Lifting Property.
Gennadiy Averkov, Amitabh Basu
2014Reverse Split Rank.
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
2014Scheduling and Fixed-Parameter Tractability.
Matthias Mnich, Andreas Wiese
2014Sequence Independent, Simultaneous and Multidimensional Lifting of Generalized Flow Covers for the Semi-Continuous Knapsack Problem with Generalized Upper Bounds Constraints.
Alejandro Angulo Cardenas, Daniel Espinoza, Rodrigo Palma
2014Short Tours through Large Linear Forests.
Uriel Feige, R. Ravi, Mohit Singh
2014Simple Extensions of Polytopes.
Volker Kaibel, Matthias Walter
2014Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines.
José R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Victor Verdugo, José Verschae
2014Submodular Maximization Meets Streaming: Matchings, Matroids, and More.
Amit Chakrabarti, Sagar Kale
2014The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs.
Chandra Chekuri, Alina Ene
2014The Cycling Property for the Clutter of Odd st-Walks.
Ahmad Abdi, Bertrand Guenin
2014The Triangle Splitting Method for Biobjective Mixed Integer Programming.
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
2014Two-Term Disjunctions on the Second-Order Cone.
Fatma Kilinç-Karzan, Sercan Yildiz
2014n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem.
Manish Bansal, Kiavash Kianfar