Skip to content

Conference on Integer Programming and Combinatorial Optimization

IPCO

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

908

1990–2026

Papers per year

199037 peak2026

IPCO papers

908 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2014Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time.Henning Bruhn, Oliver Schaudt
2014A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations.Sylvia C. Boyd, Yao Fu, Yu Sun
2014Cut Generation through Binarization.Pierre Bonami, Franois Margot
2014The Triangle Splitting Method for Biobjective Mixed Integer Programming.Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
2014Finding Small Stabilizers for Unstable Graphs.Adrian Bock, Karthekeyan Chandrasekaran, Jochen Knemann, Britta Peis, Laura Sanit
2014Network Improvement for Equilibrium Routing.Umang Bhaskar, Katrina Ligett, Leonard J. Schulman
2014A Utility Equivalence Theorem for Concave Functions.Anand Bhalgat, Sanjeev Khanna
2014On the Adaptivity Gap of Stochastic Orienteering.Nikhil Bansal, Viswanath Nagarajan
2014n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem.Manish Bansal, Kiavash Kianfar
2014Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs.Mourad Baou, Francisco Barahona
2014On the Unique-Lifting Property.Gennadiy Averkov, Amitabh Basu
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
2014Centrality of Trees for Capacitated k-Center.Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson
2014Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's Theorem.Iskander Aliev, Jess A. De Loera, Quentin Louveaux
2014A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts.Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
2014On Simplex Pivoting Rules and Complexity Theory.Ilan Adler, Christos H. Papadimitriou, Aviad Rubinstein
2014The Cycling Property for the Clutter of Odd st-Walks.Ahmad Abdi, Bertrand Guenin
2013Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines.Maxim Sviridenko, Andreas Wiese
2013Fast Deterministic Algorithms for Matrix Completion Problems.Tasuku Soma
2013Eight-Fifth Approximation for the Path TSP.Andrs Seb
20130/1 Polytopes with Quadratic Chvtal Rank.Thomas Rothvo, Laura Sanit
2013A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing.Thomas Rothvo
2013A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets.Diego Alejandro Morn Ramrez, Santanu S. Dey
2013Chain-Constrained Spanning Trees.Neil Olver, Rico Zenklusen
2013An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem.Tim Nonner, Maxim Sviridenko
351375 of 908← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.