default search action
9. CPAIOR 2012: Nantes, France
- Nicolas Beldiceanu, Narendra Jussien, Eric Pinson:
Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - 9th International Conference, CPAIOR 2012, Nantes, France, May 28 - June1, 2012. Proceedings. Lecture Notes in Computer Science 7298, Springer 2012, ISBN 978-3-642-29827-1 - Ignacio Araya
, Gilles Trombettoni, Bertrand Neveu:
A Contractor Based on Convex Interval Taylor. 1-16 - Sébastien Bardin, Arnaud Gotlieb:
fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays. 17-33 - David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker:
Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem. 34-49 - David Bergman, John N. Hooker:
Graph Coloring Facets from All-Different Systems. 50-65 - Jean-Charles Billaut, Emmanuel Hebrard
Complete Characterization of Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem. 66-80 - Alessio Bonfietti, Michele Lombardi
Global Cyclic Cumulative Constraint. 81-96 - Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan
A Computational Geometry-Based Local Search Algorithm for Planar Location Problems. 97-112 - Gilles Chabert, Sophie Demassey
The Conjunction of Interval Among Constraints. 113-128 - André A. Ciré, Elvin Coban, Willem Jan van Hoeve:
Flow-Based Combinatorial Chance Constraints. 129-145 - Nicholas Downing, Thibaut Feydy, Peter J. Stuckey:
Explaining Flow-Based Propagation. 146-162 - Tommy Färnqvist:
Constraint Optimization Problems and Bounded Tree-Width Revisited. 163-179 - Daniel Fontaine, Laurent Michel:
A High Level Language for Solver Independent Model Manipulation and Generation of Hybrid Solvers. 180-194 - Graeme Gange
Explaining Propagators for s-DNNF Circuits. 195-210 - Stefan Heinz, J. Christopher Beck:
Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling. 211-227 - Laurent Michel
Activity-Based Search for Black-Box Constraint Programming Solvers. 228-243 - Yuri Malitsky, Meinolf Sellmann:
Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. 244-259 - Florence Massen, Yves Deville
Pheromone-Based Heuristic Column Generation for Vehicle Routing Problems with Black Box Feasibility. 260-274 - Renaud Masson, Fabien Lehuédé
Simple Temporal Problems in Route Scheduling for the Dial-a-Ride Problem with Transfers. 275-291 - Quang-Dung Pham, Yves Deville
Solving the Longest Simple Path Problem with Constraint-Based Techniques. 292-306 - Aníbal Ponte, Luís Paquete
On Beam Search for Multicriteria Combinatorial Optimization Problems. 307-321 - Cédric Pralet, Gérard Verfaillie:
Combining Static and Dynamic Models for Boosting Forward Planning. 322-338 - Andrea Rendl, Matthias Prandtstetter
Hybrid Heuristics for Multimodal Homecare Scheduling. 339-355 - Ashish Sabharwal, Horst Samulowitz, Chandra Reddy:
Guiding Combinatorial Optimization with UCT. 356-361 - Andreas Schutt
Maximising the Net Present Value for Resource-Constrained Project Scheduling. 362-378 - Ben Simon, Carleton Coffrin, Pascal Van Hentenryck:
Randomized Adaptive Vehicle Decomposition for Large-Scale Power Restoration. 379-394 - Yang Wang, Zhipeng Lü, Fred W. Glover, Jin-Kao Hao
A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization. 395-408
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-01-29 21:04 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: