default search action
13. CPAIOR 2016: Banff, Alberta, Canada
- Claude-Guy Quimper:
Integration of AI and OR Techniques in Constraint Programming - 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29 - June 1, 2016, Proceedings. Lecture Notes in Computer Science 9676, Springer 2016, ISBN 978-3-319-33953-5 - Ignasi Abío, Graeme Gange, Valentin Mayer-Eichberger, Peter J. Stuckey:
On CNF Encodings of Decision Diagrams. 1-17 - Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson, Helmut Simonis:
Time-Series Constraints: Improvements and Application in CP and MIP Contexts. 18-34 - Fahiem Bacchus, George Katsirelos:
Finding a Collection of MUSes Incrementally. 35-44 - David Bergman, André A. Ciré:
Decomposition Based on Decision Diagrams. 45-54 - Kyle E. C. Booth, Tony T. Tran, J. Christopher Beck:
Logic-Based Decomposition Methods for the Travelling Purchaser Problem. 55-64 - Geoffrey Chu, Graeme Gange, Peter J. Stuckey:
Lagrangian Decomposition via Sub-problem Search. 65-80 - Allegra De Filippo, Michele Lombardi, Michela Milano:
Non-linear Optimization of Business Models in the Electricity Market. 81-97 - Diego de Uña, Graeme Gange, Peter Schachte, Peter J. Stuckey:
Weighted Spanning Tree Constraint with Explanations. 98-107 - Cyrille Dejemeppe, Olivier Devolder, Victor Lecomte, Pierre Schaus:
Forward-Checking Filtering for Nested Cardinality Constraints: Application to an Energy Cost-Aware Production Planning Problem for Tissue Manufacturing. 108-124 - Nir Drucker, Michal Penn, Ofer Strichman:
Cyclic Routing of Unmanned Aerial Vehicles. 125-141 - Thorsten Ehlers, Peter J. Stuckey:
Parallelizing Constraint Programming with Learning. 142-158 - Daniel Fontaine, Laurent D. Michel, Pascal Van Hentenryck:
Parallel Composition of Scheduling Solvers. 159-169 - Daniel Harabor, Peter J. Stuckey:
Rail Capacity Modelling with Constraint Programming. 170-186 - Aliza R. Heching, John N. Hooker:
Scheduling Home Hospice Care with Logic-Based Benders Decomposition. 187-197 - Amina Kemmar, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Thierry Charnois:
A Global Constraint for Mining Sequential Patterns with GAP Constraint. 198-215 - Joris Kinable:
A Reservoir Balancing Constraint with Applications to Bike-Sharing. 216-228 - Joris Kinable, Willem-Jan van Hoeve, Stephen F. Smith:
Optimization Models for a Real-World Snow Plow Routing Problem. 229-245 - Gilles Madi-Wamba, Nicolas Beldiceanu:
The TaskIntersection Constraint. 246-261 - Thierry Martinez, François Fages, Abder Aggoun:
A Stochastic Continuous Optimization Backend for MiniZinc with Applications to Geometrical Placement Problems. 262-278 - Guillaume Perez, Jean-Charles Régin:
Constructions and In-Place Operations for MDDs Based Constraints. 279-293 - Gilles Pesant:
Balancing Nursing Workload by Constraint Programming. 294-302 - Eliott Roynette, Bertrand Cabon, Cédric Pralet, Vincent Vidal:
Designing Spacecraft Command Loops Using Two-Dimension Vehicle Routing. 303-318 - Abdelilah Sakti, Lawrence Zeidner, Tarik Hadzic, Brian St. Rock, Giusi Quartarone:
Constraint Programming Approach for Spatial Packaging Problem. 319-328 - Domenico Salvagnin:
Detecting Semantic Groups in MIP Models. 329-341 - Mohamed Siala, Barry O'Sullivan:
Revisiting Two-Sided Stability Constraints. 342-357 - Byron Tasseff, Russell Bent, Pascal Van Hentenryck:
Optimal Flood Mitigation over Flood Propagation Approximations. 358-373 - Wenxi Wang, Harald Søndergaard, Peter J. Stuckey:
A Bit-Vector Solver with Word-Level Propagation. 374-391 - Hong Xu, T. K. Satish Kumar, Sven Koenig:
A New Solver for the Minimum Weighted Vertex Cover Problem. 392-405 - Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl:
Optimal Upgrading Schemes for Effective Shortest Paths in Networks. 406-420
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.