default search action
16th CPAIOR 2019: Thessaloniki, Greece
- Louis-Martin Rousseau, Kostas Stergiou:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4-7, 2019, Proceedings. Lecture Notes in Computer Science 11494, Springer 2019, ISBN 978-3-030-19211-2 - Roberto Amadini, Mak Andrlon
, Graeme Gange, Peter Schachte
Constraint Programming for Dynamic Symbolic Execution of JavaScript. 1-19 - Blair Archibald
Sequential and Parallel Solution-Biased Search for Subgraph Algorithms. 20-38 - Jeremias Berg
Core-Boosted Linear Search for Incomplete MaxSAT. 39-56 - David Bergman
Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation. 57-66 - Timo Berthold, Peter J. Stuckey, Jakob Witzig:
Local Rapid Learning for Integer Programs. 67-83 - Jakob Witzig, Timo Berthold, Stefan Heinz:
A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming. 84-94 - Gustav Björdal
Generating Compound Moves in Local Search by Hybridisation with Complete Search. 95-111 - Miquel Bofill
SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations. 112-128 - Kyle E. C. Booth, J. Christopher Beck:
A Constraint Programming Approach to Electric Vehicle Routing with Time Windows. 129-145 - Danuta Sorina Chisca, Michele Lombardi, Michela Milano, Barry O'Sullivan:
A Sampling-Free Anticipatory Algorithm for the Kidney Exchange Problem. 146-162 - Carleton Coffrin, Harsha Nagarajan, Russell Bent
Evaluating Ising Processing Units with Integer Programming. 163-181 - Pierre Coste, Andrea Lodi, Gilles Pesant:
Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems. 182-191 - Waldemar Cruz, Fanghui Liu, Laurent Michel:
A Counting-Based Approach to Scalable Micro-service Deployment. 192-207 - Günther Cwioro, Philipp Hungerländer, Kerstin Maier
An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service. 208-224 - Danial Davarnia, John N. Hooker:
Consistency for 0-1 Programming. 225-240 - Emir Demirovic, Peter J. Stuckey, James Bailey, Jeffrey Chan
An Investigation into Prediction + Optimisation for the Knapsack Problem. 241-257 - Guillaume Derval
The Maximum Weighted Submatrix Coverage Problem: A CP Approach. 258-274 - Martina Fischetti, Andrea Lodi, Giulia Zarpellon:
Learning MILP Resolution Outcomes Before Reaching Time-Limit. 275-291 - Cristian Frasinaru, Madalina Raschip
An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem. 292-303 - Tobias Geibinger
Investigating Constraint Programming for Real World Industrial Test Laboratory Scheduling. 304-319 - Begum Genc, Mohamed Siala, Gilles Simonin
An Approach to Robustness in the Stable Roommates Problem and Its Comparison with the Stable Marriage Problem. 320-336 - Alexandre Gondran
Optimality Clue for Graph Coloring Problem. 337-354 - Gennaro Auricchio, Federico Bassetti, Stefano Gualandi
Computing Wasserstein Barycenters via Linear Programming. 355-363 - Dario Guidotti
Repairing Learned Controllers with Convex Optimization: A Case Study. 364-373 - Emmanuel Hebrard
A Hybrid Approach for Exact Coloring of Massive Graphs. 374-390 - Lucas Kletzander, Nysret Musliu
Modelling and Solving the Minimum Shift Design Problem. 391-408 - Burak Kocuk
A Computational Comparison of Optimization Methods for the Golomb Ruler Problem. 409-425 - Arnaud Malapert, Margaux Nattaf
A New CP-Approach for a Parallel Machine Scheduling Problem with Time Constraints on Machine Qualifications. 426-442 - Paul J. Nicholas, Karla L. Hoffman:
Efficient Solution Methods for the Cumulative-Interference Channel Assignment Problem Using Integer Optimization and Constraint Programming. 443-460 - Nikolaos Ploskas
Heat Exchanger Circuitry Design by Decision Diagrams. 461-471 - Connor Riley, Antoine Legrain, Pascal Van Hentenryck:
Column Generation for Real-Time Ride-Sharing Operations. 472-487 - Domenico Salvagnin:
Some Experiments with Submodular Function Maximization via Integer Programming. 488-501 - Buser Say, Scott Sanner:
Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation. 502-518 - Thiago Serra, Arvind U. Raghunathan, David Bergman, John N. Hooker, Shingo Kobori:
Last-Mile Scheduling Under Uncertainty. 519-528 - Yuji Shinano
Building Optimal Steiner Trees on Supercomputers by Using up to 43, 000 Cores. 529-539 - Yingcong Tan, Andrew Delong, Daria Terekhov:
Deep Inverse Optimization. 540-556 - Ziye Tang, Willem-Jan van Hoeve, Paul Shaw:
A Study on the Traveling Salesman Problem with a Drone. 557-564 - Pim van den Bogaerdt, Mathijs de Weerdt:
Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams. 565-580 - Hélène Verhaeghe
Extending Compact-Diagram to Basic Smart Multi-Valued Variable Diagrams. 581-598 - Ruiwei Wang, Roland H. C. Yap:
Arc Consistency Revisited. 599-615 - Yexiang Xue, Willem-Jan van Hoeve:
Embedding Decision Diagrams into Generative Adversarial Networks. 616-632 - Moli Yang, Andreas Schutt, Peter J. Stuckey:
Time Table Edge Finding with Energy Variables. 633-642 - Ka Wa Yip
Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. 643-660
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-04 20:01 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: