default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17. IPCO 2014: Bonn, Germany
- Jon Lee, Jens Vygen:
Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings. Lecture Notes in Computer Science 8494, Springer 2014, ISBN 978-3-319-07556-3 - Ahmad Abdi, Bertrand Guenin:
The Cycling Property for the Clutter of Odd st-Walks. 1-12 - Ilan Adler, Christos H. Papadimitriou, Aviad Rubinstein:
On Simplex Pivoting Rules and Complexity Theory. 13-24 - Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne:
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts. 25-36 - Iskander Aliev, Jesús A. De Loera, Quentin Louveaux:
Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's Theorem. 37-51 - Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson:
Centrality of Trees for Capacitated k-Center. 52-63 - Alejandro Angulo Cardenas
, Daniel Espinoza, Rodrigo Palma:
Sequence Independent, Simultaneous and Multidimensional Lifting of Generalized Flow Covers for the Semi-Continuous Knapsack Problem with Generalized Upper Bounds Constraints. 64-75 - Gennadiy Averkov, Amitabh Basu:
On the Unique-Lifting Property. 76-87 - Mourad Baïou, Francisco Barahona:
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. 88-101 - Manish Bansal, Kiavash Kianfar:
n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem. 102-113 - Nikhil Bansal, Viswanath Nagarajan:
On the Adaptivity Gap of Stochastic Orienteering. 114-125 - Anand Bhalgat, Sanjeev Khanna:
A Utility Equivalence Theorem for Concave Functions. 126-137 - Umang Bhaskar, Katrina Ligett, Leonard J. Schulman:
Network Improvement for Equilibrium Routing. 138-149 - Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità:
Finding Small Stabilizers for Unstable Graphs. 150-161 - Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh:
The Triangle Splitting Method for Biobjective Mixed Integer Programming. 162-173 - Pierre Bonami, François Margot:
Cut Generation through Binarization. 174-185 - Sylvia C. Boyd, Yao Fu, Yu Sun:
A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations. 186-197 - Christoph Buchheim, Claudia D'Ambrosio:
Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators. 198-209 - Amit Chakrabarti, Sagar Kale:
Submodular Maximization Meets Streaming: Matchings, Matroids, and More. 210-221 - Chandra Chekuri, Alina Ene:
The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs. 222-233 - Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse Split Rank. 234-248 - José R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Victor Verdugo, José Verschae:
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines. 249-260 - Santanu S. Dey, Marco Molinaro, Qianyi Wang:
How Good Are Sparse Cutting-Planes? 261-272 - Uriel Feige, R. Ravi, Mohit Singh:
Short Tours through Large Linear Forests. 273-284 - Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani:
Linear Programming Hierarchies Suffice for Directed Steiner Tree. 285-296 - Chien-Chung Huang, Telikepalli Kavitha:
An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. 297-308 - Volker Kaibel, Matthias Walter:
Simple Extensions of Polytopes. 309-320 - Volker Kaibel, Stefan Weltge:
Lower Bounds on the Sizes of Integer Programs without Additional Variables. 321-332 - Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson:
On the Configuration LP for Maximum Budgeted Allocation. 333-344 - Fatma Kilinç-Karzan, Sercan Yildiz:
Two-Term Disjunctions on the Second-Order Cone. 345-356 - Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku:
Coupled and k-Sided Placements: Generalizing Generalized Assignment. 357-368 - Lap Chi Lau, Hong Zhou:
A Unified Algorithm for Degree Bounded Survivable Network Design. 369-380 - Matthias Mnich, Andreas Wiese:
Scheduling and Fixed-Parameter Tractability. 381-392 - Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa:
Improved Branch-Cut-and-Price for Capacitated Vehicle Routing. 393-403 - Henning Bruhn, Oliver Schaudt:
Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time. 404-415
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-26 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
