default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11. CPAIOR 2014: Cork, Ireland
- Helmut Simonis:
Integration of AI and OR Techniques in Constraint Programming - 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014. Proceedings. Lecture Notes in Computer Science 8451, Springer 2014, ISBN 978-3-319-07045-2 - Thierry Benoist, Antoine Jeanjean, Vincent Jost
:
Call-Based Dynamic Programming for the Precedence Constrained Line Traveling Salesman. 1-14 - Patrick Prosser:
Stable Roommates and Constraint Programming. 15-28 - Domenico Salvagnin:
Detecting and Exploiting Permutation Structures in MIPs. 29-44 - Quoc Trung Bui, Quang-Dung Pham, Yves Deville:
Solving the Quorumcast Routing Problem as a Mixed Integer Program. 45-54 - Sebastian Kosch, J. Christopher Beck:
A New MIP Model for Parallel-Batch Scheduling with Non-identical Job Sizes. 55-70 - Willy Ugarte Rojas, Patrice Boizumault, Samir Loudni, Bruno Crémilleux, Alban Lepailleur:
Mining (Soft-) Skypatterns Using Dynamic CSP. 71-87 - Christopher Mears, Andreas Schutt, Peter J. Stuckey, Guido Tack, Kim Marriott, Mark Wallace:
Modelling with Option Types in MiniZinc. 88-103 - Bruno Belin, Marc Christie, Charlotte Truchet:
Interactive Design of Sustainable Cities with a Distributed Local Search Solver. 104-119 - Nebras Gharbi, Fred Hemery, Christophe Lecoutre, Olivier Roussel:
Sliced Table Constraints: Combining Compression and Tabular Reduction. 120-135 - Maxim Hoskins, Renaud Masson, Gabrielle Gauthier Melançon, Jorge E. Mendoza, Christophe Meyer, Louis-Martin Rousseau:
The PrePack Optimization Problem. 136-143 - Jeffrey Larson, Mikael Johansson, Mats Carlsson:
An Integrated Constraint Programming Approach to Scheduling Sports Leagues with Divisional and Round-Robin Tournaments. 144-158 - Gleb Belov, Natashia Boland, Martin W. P. Savelsbergh, Peter J. Stuckey:
Local Search for a Cargo Assembly Planning Problem. 159-175 - Joris Kinable, Michael A. Trick:
A Logic Based Benders' Approach to the Concrete Delivery Problem. 176-192 - Andrea Reale, Paolo Bellavista, Antonio Corradi, Michela Milano:
Evaluating CP Techniques to Plan Dynamic Resource Provisioning in Distributed Stream Processing. 193-209 - Alessio Bonfietti, Michele Lombardi, Michela Milano:
Disregarding Duration Uncertainty in Partial Order Schedules? Yes, We Can! 210-225 - Ciaran McCreesh, Patrick Prosser:
An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem. 226-234 - Jean-Baptiste Mairy, Yves Deville, Christophe Lecoutre:
Domain k-Wise Consistency Made as Simple as Generalized Arc Consistency. 235-250 - Pedro Barahona, Steffen Hölldobler, Van-Hau Nguyen:
Representative Encodings to Translate Finite CSPs into SAT. 251-267 - Christian Artigues, Emmanuel Hebrard, Valentin Mayer-Eichberger, Mohamed Siala, Toby Walsh:
SAT and Hybrid Models of the Car Sequencing Problem. 268-283 - Cyrille Dejemeppe, Yves Deville:
Continuously Degrading Resource and Interval Dependent Activity Durations in Nuclear Medicine Patient Scheduling. 284-292 - Michele Lombardi, Pierre Schaus:
Cost Impact Guided LNS. 293-300 - Barry Hurley, Lars Kotthoff, Yuri Malitsky, Barry O'Sullivan:
Proteus: A Hierarchical Portfolio of Solvers and Transformations. 301-317 - Christian Bessiere, Emmanuel Hebrard, Marc-André Ménard, Claude-Guy Quimper, Toby Walsh:
Buffered Resource Constraint: Algorithms and Complexity. 318-333 - Wen-Yang Ku, J. Christopher Beck:
Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems. 334-350 - David Bergman, André A. Ciré, Ashish Sabharwal, Horst Samulowitz, Vijay A. Saraswat, Willem Jan van Hoeve:
Parallel Combinatorial Optimization with Decision Diagrams. 351-367 - Yuri Malitsky, Barry O'Sullivan, Alessandro Previti, João Marques-Silva:
A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems. 368-376 - Thierry Moisan, Claude-Guy Quimper, Jonathan Gaudreault:
Parallel Depth-Bounded Discrepancy Search. 377-393 - Matteo Fischetti, Michele Monaci, Domenico Salvagnin:
Self-splitting of Workload in Parallel Computation. 394-404 - Michael Morin, Claude-Guy Quimper:
The Markov Transition Constraint. 405-421 - Sohaib Afifi, Rym Nesrine Guibadj, Aziz Moukrim:
New Lower Bounds on the Number of Vehicles for the Vehicle Routing Problem with Time Windows. 422-437 - Behrouz Babaki, Tias Guns, Siegfried Nijssen:
Constrained Clustering Using Column Generation. 438-454 - Seyed Hossein Hashemi Doulabi, Louis-Martin Rousseau, Gilles Pesant:
A Constraint Programming-Based Column Generation Approach for Operating Room Planning and Scheduling. 455-463 - Paul Morris:
Dynamic Controllability and Dispatchability Relationships. 464-479
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 2024-11-11 21:15 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:
