default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th CPAIOR 2018: Delft, The Netherlands
- Willem Jan van Hoeve:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26-29, 2018, Proceedings. Lecture Notes in Computer Science 10848, Springer 2018, ISBN 978-3-319-93030-5 - Hajar Ait Addi, Christian Bessiere, Redouane Ezzahir, Nadjib Lazaar
:
Time-Bounded Query Generator for Constraint Acquisition. 1-17 - Roberto Amadini, Graeme Gange, Peter J. Stuckey:
Propagating lex, find and replace with Dashed Strings. 18-34 - Mohammad Javad Azizi, Phebe Vayanos, Bryan Wilder, Eric Rice, Milind Tambe:
Designing Fair, Efficient, and Interpretable Policies for Prioritizing Homeless Youth for Housing Resources. 35-51 - Junwen Bai, Sebastian Ament, Guillaume Perez, John M. Gregoire, Carla P. Gomes:
An Efficient Relaxed Projection Method for Constrained Non-negative Matrix Factorization with Application to the Phase-Mapping Problem in Materials Science. 52-62 - Ahmad Baubaid, Natashia Boland, Martin W. P. Savelsbergh:
Dealing with Demand Uncertainty in Service Network and Load Plan Design. 63-71 - Ondrej Benedikt, Premysl Sucha, István Módos, Marek Vlk, Zdenek Hanzálek:
Energy-Aware Production Scheduling with Power-Saving Modes. 72-81 - Quentin Cappart, John O. R. Aoga, Pierre Schaus:
EpisodeSupport: A Global Constraint for Mining Frequent Patterns in a Long Sequence of Events. 82-99 - Allegra De Filippo, Michele Lombardi, Michela Milano:
Off-Line and On-Line Optimization Under Uncertainty: A Case Study on Energy Management. 100-116 - Renaud De Landtsheer, Yoann Guyot, Gustavo Ospina, Fabian Germeau, Christophe Ponsard:
Reasoning on Sequences in Constraint-Based Local Search Frameworks. 117-134 - Emir Demirovic, Peter J. Stuckey:
Constraint Programming for High School Timetabling: A Scheduling-Based Model with Hot Starts. 135-152 - Guilherme Alex Derenievicz, Fabiano Silva:
Epiphytic Trees: Relational Consistency Applied to Global Optimization Problems. 153-169 - Michel Deudon, Pierre Cournut, Alexandre Lacoste, Yossiri Adulyasak, Louis-Martin Rousseau:
Learning Heuristics for the TSP by Policy Gradient. 170-181 - Guillaume Escamocher, Barry O'Sullivan:
Three-Dimensional Matching Instances Are Rich in Stable Matchings. 182-197 - Guillaume Escamocher, Mohamed Siala, Barry O'Sullivan:
From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP. 198-214 - Ferdinando Fioretto, Pascal Van Hentenryck:
Constrained-Based Differential Privacy: Releasing Optimal Power Flow Benchmarks Privately - Releasing Optimal Power Flow Benchmarks Privately. 215-231 - Matteo Fischetti, Domenico Salvagnin:
Chasing First Queens by Integer Programming. 232-244 - Samuel Gagnon, Gilles Pesant:
Accelerating Counting-Based Search. 245-253 - Andrea Galassi, Michele Lombardi, Paola Mello, Michela Milano:
Model Agnostic Solution of CSPs via Deep Learning: A Preliminary Study. 254-262 - Jonathan Michael Gomes Selman, Qinru Shi, Yexiang Xue, Roosevelt García-Villacorta, Alexander S. Flecker, Carla P. Gomes:
Boosting Efficiency for Computing the Pareto Frontier on Tree Structured Networks. 263-279 - Christian Hamelain, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik:
Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube Design. 280-288 - Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh:
A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem. 289-297 - Ruth Hoffmann, Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Craig Reilly, Christine Solnon, James Trimble:
Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. 298-315 - Roger Kameugne, Sévérine Betmbe Fetgo, Vincent Gingras, Yanick Ouellet, Claude-Guy Quimper:
Horizontally Elastic Not-First/Not-Last Filtering Algorithm for Cumulative Resource Constraint. 316-332 - Minh Thanh Khong, Christophe Lecoutre, Pierre Schaus, Yves Deville:
Soft-Regular with a Prefix-Size Violation Measure. 333-343 - Damla Kizilay, Deniz Türsel Eliiyi, Pascal Van Hentenryck:
Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations. 344-360 - Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen:
Heuristic Variants of A ^* Search for 3D Flight Planning. 361-376 - Ole Kröger, Carleton Coffrin, Hassan L. Hijazi, Harsha Nagarajan:
Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia. 377-386 - Philippe Laborie:
Objective Landscapes for Constraint Programming. 387-402 - Philippe Laborie:
An Update on the Comparison of MIP, CP and Hybrid Approaches for Mixed Resource Allocation and Scheduling. 403-411 - Chang Liu, Dionne M. Aleman, J. Christopher Beck:
Modelling and Solving the Senior Transportation Problem. 412-428 - Nysret Musliu, Andreas Schutt, Peter J. Stuckey:
Solver Independent Rotating Workforce Scheduling. 429-445 - Angelo Oddi, Riccardo Rasconi:
Greedy Randomized Search for Scalable Compilation of Quantum Circuits. 446-461 - Philippe Olivier, Andrea Lodi, Gilles Pesant:
A Comparison of Optimization Methods for Multi-objective Constrained Bin Packing Problems. 462-476 - Yanick Ouellet, Claude-Guy Quimper:
A O(n \log ^2 n) Checker and O(n^2 \log n) Filtering Algorithm for the Energetic Reasoning. 477-494 - Kim Rioux-Paradis, Claude-Guy Quimper:
The WeightedCircuitsLmax Constraint. 495-511 - Michael Römer, André A. Ciré, Louis-Martin Rousseau:
A Local Search Framework for Compiling Relaxed Decision Diagrams. 512-520 - Domenico Salvagnin:
Symmetry Breaking Inequalities from the Schreier-Sims Table. 521-529 - Vourchteang Sea, Ayumi Sugiyama, Toshiharu Sugawara:
Frequency-Based Multi-agent Patrolling Model and Its Area Partitioning Solution Method for Balanced Workload. 530-545 - Sergei P. Sidorov, Alexey R. Faizliev, Alexander A. Gudkov, Sergei V. Mironov:
Algorithms for Sparse k-Monotone Regression. 546-556 - Charles Thomas, Pierre Schaus:
Revisiting the Self-adaptive Large Neighborhood Search. 557-566 - Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar:
A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. 567-584 - Zhijiang Ye, Buser Say, Scott Sanner:
Symbolic Bucket Elimination for Piecewise Continuous Constrained Optimization. 585-594 - Pierre Bonami, Andrea Lodi, Giulia Zarpellon:
Learning a Classification of Mixed-Integer Quadratic Programming Problems. 595-604 - Max Åstrand, Mikael Johansson, Alessandro Zanarini:
Fleet Scheduling in Underground Mines Using Constraint Programming. 605-613
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-12-05 20:32 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:
