Skip to content

International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems

CPAIOR

B

CORE rank

CORE rank (raw)

B

Fields of research

Artificial Intelligence

Papers indexed

762

2004–2026

Papers per year

200451 peak2026

CPAIOR papers

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

YearTitleAuthors
2012Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem.David Bergman, Andr A. Cir, Willem Jan van Hoeve, John N. Hooker
2012fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays.Sbastien Bardin, Arnaud Gotlieb
2012A Contractor Based on Convex Interval Taylor.Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
2011Identifying Patterns in Sequences of Variables.Alessandro Zanarini, Pascal Van Hentenryck
2011Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources.Petr Vilm
2011A New Algorithm for Linear and Integer Feasibility in Horn Constraints.K. Subramani, James Worthington
2011Efficient Planning of Substation Automation System Cables.Thanikesavan Sivanthi, Jan Poland
2011Almost Square Packing.Helmut Simonis, Barry O'Sullivan
2011The Objective Sum Constraint.Jean-Charles Rgin, Thierry Petit
2011Using Hard Constraints for Representing Soft Constraints.Jean-Charles Rgin
2011Recovering Indirect Solution Densities for Counting-Based Branching Heuristics.Gilles Pesant, Alessandro Zanarini
2011A Probing Algorithm for MINLP with Failure Prediction by SVM.Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff T. Linderoth, Franois Margot, Andreas Wchter
2011Precedence Constraint Posting for Cyclic Scheduling Problems.Michele Lombardi, Alessio Bonfietti, Michela Milano, Luca Benini
2011On Counting Lattice Points and Chvtal-Gomory Cutting Planes.Andrea Lodi, Gilles Pesant, Louis-Martin Rousseau
2011On Bilevel Programming and Its Impact in Branching, Cutting and Complexity.Andrea Lodi
2011Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks.Asma Lahimer, Pierre Lopez, Mohamed Haouari
2011Branch-Cut-and-Propagate for the MaximumTim Januschowski, Marc E. Pfetsch
2011Propagation in Constraints: How One Thing Leads to Another.Ian P. Gent
2011Parallel Machine Scheduling with Additional Resources: A Lagrangian-Based Constraint Programming Approach.Emrah B. Edis, Ceyda Oguz
2011Upgrading Shortest Paths in Networks.Bistra Dilkina, Katherine J. Lai, Carla P. Gomes
2011Spatial and Objective Decompositions for Very Large SCAPs.Carleton Coffrin, Pascal Van Hentenryck, Russell Bent
2011Retail Store Workforce Scheduling by Expected Operating Income Maximization.Nicolas Chapados, Marc Joliveau, Louis-Martin Rousseau
2011Preference Elicitation and Preference Learning in Social Choice.Craig Boutilier
2011The AllDifferent Constraint with Precedences.Christian Bessiere, Nina Narodytska, Claude-Guy Quimper, Toby Walsh
2011Manipulating MDD Relaxations for Combinatorial Optimization.David Bergman, Willem Jan van Hoeve, John N. Hooker
501525 of 762← PreviousNext →

Comparable venues

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