default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. CPAIOR 2008: Paris, France
- Laurent Perron, Michael A. Trick:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, CPAIOR 2008, Paris, France, May 20-23, 2008, Proceedings. Lecture Notes in Computer Science 5015, Springer 2008, ISBN 978-3-540-68154-0
Invited Talks
- Cynthia Barnhart
:
Airline Scheduling: Accomplishments, Opportunities and Challenges. 1 - François Laburthe:
Selected Challenges from Distribution and Commerce in the Airline and Travel Industry. 2-4 - Pascal Van Hentenryck:
30 Years of Constraint Programming. 5
Long Papers
- Tobias Achterberg, Timo Berthold, Thorsten Koch, Kati Wolter:
Constraint Integer Programming: A New Approach to Integrate CP and MIP. 6-20 - Nicolas Beldiceanu, Mats Carlsson, Emmanuel Poder:
New Filtering for the cumulative Constraint in the Context of Non-Overlapping Rectangles. 21-35 - Luca Benini, Michele Lombardi, Marco Mantovani, Michela Milano, Martino Ruggiero:
Multi-stage Benders Decomposition for Optimizing Multicore Architectures. 36-50 - Hadrien Cambazard, John Horan, Eoin O'Mahony, Barry O'Sullivan:
Fast and Scalable Domino Portrait Generation. 51-65 - Grégoire Dooms, Pascal Van Hentenryck:
Gap Reduction Techniques for Online Stochastic Project Scheduling. 66-81 - Alex S. Fukunaga:
Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver. 82-96 - Birgit Grohe, Dag Wedelin:
Cost Propagation - Numerical Propagation for Optimization Problems. 97-111 - Ivan Heckman, J. Christopher Beck:
Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs. 112-126 - Lukas Kroc, Ashish Sabharwal, Bart Selman:
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. 127-141 - Daniel H. Leventhal, Meinolf Sellmann:
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems. 142-157 - Christopher Mears, Maria J. García de la Banda, Mark Wallace, Bart Demoen:
A Novel Approach For Detecting Symmetries in CSP Models. 158-172 - Luc Mercier, Pascal Van Hentenryck:
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization. 173-187 - Laurent Michel, Alexander A. Shvartsman, Elaine L. Sonderegger, Pascal Van Hentenryck:
Optimal Deployment of Eventually-Serializable Data Services. 188-202 - Gilles Pesant, Claude-Guy Quimper:
Counting Solutions of Knapsack Constraints. 203-217 - Jakob Puchinger, Peter J. Stuckey, Mark Wallace, Sebastian Brand:
From High-Level Model to Branch-and-Price Solution in G12. 218-232 - Jean-Charles Régin:
Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint. 233-247 - Tino Teige, Martin Fränzle:
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic. 248-262 - Jean-Paul Watson, J. Christopher Beck:
A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem. 263-277
Short Papers
- Tobias Achterberg, Stefan Heinz, Thorsten Koch:
Counting Solutions of Integer Programs Using Unrestricted Subtree Detection. 278-282 - Douglas S. Altner, Özlem Ergun:
Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts. 283-287 - Ada Barlatt, Amy Mainville Cohn, Oleg Yu. Gusikhin:
A Hybrid Approach for Solving Shift-Selection and Task-Sequencing Problems. 288-292 - Nizar El Hachemi, Michel Gendreau, Louis-Martin Rousseau:
Solving a Log-Truck Scheduling Problem with Constraint Programming. 293-297 - Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant:
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. 298-302 - Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal:
Connections in Networks: A Hybrid Approach. 303-307 - Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira:
Efficient Haplotype Inference with Combined CP and OR Techniques. 308-312 - Boris Gutkovich:
Integration of CP and Compilation Techniques for Instruction Sequence Test Generation. 313-317 - Tarik Hadzic, John N. Hooker, Peter Tiedemann:
Propagating Separable Equalities in an MDD Store. 318-322 - George Katsirelos, Nina Narodytska, Toby Walsh:
The Weighted CfgConstraint. 323-327 - Madjid Khichane, Patrick Albert, Christine Solnon:
CP with ACO. 328-332 - Hoong Chuin Lau, Kong Wei Lye, Viet Bang Nguyen:
A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract). 333-337 - Paul Maier, Martin Sachenbacher:
Constraint Optimization and Abstraction for Embedded Intelligent Systems. 338-342 - Mahdi Namazifar, Andrew J. Miller:
A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs. 343-348 - Yehuda Naveh:
Guiding Stochastic Search by Dynamic Learning of the Problem Topography. 349-354 - Angelo Oddi, Amedeo Cesta, Nicola Policella, Stephen F. Smith:
Hybrid Variants for Iterative Flattening Search. 355-360 - Thierry Petit, Emmanuel Poder:
Global Propagation of Practicability Constraints. 361-366 - Meinolf Sellmann:
The Polytope of Tree-Structured Binary Constraint Satisfaction Problems. 367-371 - Charlotte Truchet, Marc Christie, Jean-Marie Normand:
A Tabu Search Method for Interval Constraints. 372-376 - Pascal Van Hentenryck, Laurent Michel:
The Steel Mill Slab Design Problem Revisited. 377-381 - Willem Jan van Hoeve, Ashish Sabharwal:
Filtering Atmost1 on Pairs of Set Variables. 382-386
Extended Abstract
- Luca Quadrifoglio, Maged M. Dessouky, Fernando Ordóñez:
Mobility Allowance Shuttle Transit (MAST) Services: MIP Formulation and Strengthening with Logic Constraints. 387-391
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-05-31 23:32 CEST 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:
