CPAIOR B

24 papers

YearTitle / Authors
2011A New Algorithm for Linear and Integer Feasibility in Horn Constraints.
K. Subramani, James Worthington
2011A Probing Algorithm for MINLP with Failure Prediction by SVM.
Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff T. Linderoth, François Margot, Andreas Wächter
2011Almost Square Packing.
Helmut Simonis, Barry O'Sullivan
2011Branch-Cut-and-Propagate for the Maximum
Tim Januschowski, Marc E. Pfetsch
2011Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks.
Asma Lahimer, Pierre Lopez, Mohamed Haouari
2011Efficient Planning of Substation Automation System Cables.
Thanikesavan Sivanthi, Jan Poland
2011Identifying Patterns in Sequences of Variables.
Alessandro Zanarini, Pascal Van Hentenryck
2011Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 8th International Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011. Proceedings
Tobias Achterberg, J. Christopher Beck
2011Manipulating MDD Relaxations for Combinatorial Optimization.
David Bergman, Willem Jan van Hoeve, John N. Hooker
2011On Bilevel Programming and Its Impact in Branching, Cutting and Complexity.
Andrea Lodi
2011On Counting Lattice Points and Chvátal-Gomory Cutting Planes.
Andrea Lodi, Gilles Pesant, Louis-Martin Rousseau
2011Optimization Methods for the Partner Units Problem.
Markus Aschinger, Conrad Drescher, Gerhard Friedrich, Georg Gottlob, Peter Jeavons, Anna Ryabokon, Evgenij Thorstensen
2011Parallel Machine Scheduling with Additional Resources: A Lagrangian-Based Constraint Programming Approach.
Emrah B. Edis, Ceyda Oguz
2011Precedence Constraint Posting for Cyclic Scheduling Problems.
Michele Lombardi, Alessio Bonfietti, Michela Milano, Luca Benini
2011Preference Elicitation and Preference Learning in Social Choice.
Craig Boutilier
2011Propagation in Constraints: How One Thing Leads to Another.
Ian P. Gent
2011Recovering Indirect Solution Densities for Counting-Based Branching Heuristics.
Gilles Pesant, Alessandro Zanarini
2011Retail Store Workforce Scheduling by Expected Operating Income Maximization.
Nicolas Chapados, Marc Joliveau, Louis-Martin Rousseau
2011Spatial and Objective Decompositions for Very Large SCAPs.
Carleton Coffrin, Pascal Van Hentenryck, Russell Bent
2011The AllDifferent Constraint with Precedences.
Christian Bessiere, Nina Narodytska, Claude-Guy Quimper, Toby Walsh
2011The Objective Sum Constraint.
Jean-Charles Régin, Thierry Petit
2011Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources.
Petr Vilím
2011Upgrading Shortest Paths in Networks.
Bistra Dilkina, Katherine J. Lai, Carla P. Gomes
2011Using Hard Constraints for Representing Soft Constraints.
Jean-Charles Régin