9. CPAIOR 2012: Nantes, France
Nicolas Beldiceanu, Narendra Jussien, Eric Pinson (Eds.): 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. Springer 2012 Lecture Notes in Computer Science 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
- Jean-Charles Billaut, Emmanuel Hebrard, Pierre Lopez: Complete Characterization of Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem. 66-80
- Alessio Bonfietti, Michele Lombardi, Luca Benini, Michela Milano: Global Cyclic Cumulative Constraint. 81-96
- Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada: A Computational Geometry-Based Local Search Algorithm for Planar Location Problems. 97-112
- André A. Ciré, Elvin Coban, Willem Jan van Hoeve: Flow-Based Combinatorial Chance Constraints. 129-145
- 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
- Stefan Heinz, J. Christopher Beck: Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling. 211-227
- Laurent Michel, Pascal Van Hentenryck: 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, Pascal Van Hentenryck: Pheromone-Based Heuristic Column Generation for Vehicle Routing Problems with Black Box Feasibility. 260-274
- Renaud Masson, Fabien Lehuédé, Olivier Péton: 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, José Rui Figueira: 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, Gerhard Hiermann, Jakob Puchinger, Günther R. Raidl: Hybrid Heuristics for Multimodal Homecare Scheduling. 339-355
- Ashish Sabharwal, Horst Samulowitz, Chandra Reddy: Guiding Combinatorial Optimization with UCT. 356-361
- Andreas Schutt, Geoffrey Chu, Peter J. Stuckey, Mark G. Wallace: 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 Glover, Jin-Kao Hao: A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization. 395-408
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team