default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th CP 2023: Toronto, ON, Canada
- Roland H. C. Yap
:
29th International Conference on Principles and Practice of Constraint Programming, CP 2023, August 27-31, 2023, Toronto, Canada. LIPIcs 280, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-300-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Maria Garcia de la Banda:
Beyond Optimal Solutions for Real-World Problems (Invited Talk). 1:1-1:4 - Jimmy H. M. Lee:
A Tale of Two Cities: Teaching CP with Story-Telling (Invited Talk). 2:1-2:1 - Laurent Perron, Frédéric Didier, Steven Gay:
The CP-SAT-LP Solver (Invited Talk). 3:1-3:2 - Thomas Schiex:
Coupling CP with Deep Learning for Molecular Design and SARS-CoV2 Variants Exploration (Invited Talk). 4:1-4:3 - Petr Vilím:
CP Solver Design for Maximum CPU Utilization (Invited Talk). 5:1-5:1 - Younes Aalian, Gilles Pesant, Michel Gamache:
Optimization of Short-Term Underground Mine Planning Using Constraint Programming. 6:1-6:16 - Josep Alòs, Carlos Ansótegui, Josep M. Salvia, Eduard Torres:
Exploiting Configurations of MaxSAT Solvers. 7:1-7:16 - João Araújo, Choiwah Chow, Mikolás Janota:
Symmetries for Cube-And-Conquer in Finite Model Finding. 8:1-8:19 - Gilles Audemard, Christophe Lecoutre, Charles Prud'homme:
Guiding Backtrack Search by Tracking Variables During Constraint Propagation. 9:1-9:17 - Aymeric Beauchamp, Thi-Bich-Hanh Dao, Samir Loudni, Christel Vrain:
Incremental Constrained Clustering by Minimal Weighted Modification. 10:1-10:22 - Ignace Bleukx, Jo Devriendt, Emilio Gamba, Bart Bogaerts, Tias Guns:
Simplifying Step-Wise Explanation Sequences. 11:1-11:20 - Yi Chu, Shaowei Cai, Chuan Luo, Zhendong Lei, Cong Peng:
Towards More Efficient Local Search for Pseudo-Boolean Optimization. 12:1-12:18 - Vianney Coppé, Xavier Gillard, Pierre Schaus:
Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic Programming. 13:1-13:17 - Arnaud Deza, Chang Liu, Pashootan Vaezipoor, Elias B. Khalil:
Fast Matrix Multiplication Without Tears: A Constraint Programming Approach. 14:1-14:15 - Alexandre Dubray, Pierre Schaus, Siegfried Nijssen:
Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses. 15:1-15:17 - Yousra El Ghazi, Djamal Habet, Cyril Terrioux:
A CP Approach for the Liner Shipping Network Design Problem. 16:1-16:21 - Arnoosh Golestanian, Giovanni Lo Bianco, Chengyu Tao, J. Christopher Beck:
Optimization Models for Pickup-And-Delivery Problems with Reconfigurable Capacities. 17:1-17:17 - Christoph Jabs, Jeremias Berg, Hannes Ihalainen, Matti Järvisalo:
Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization. 18:1-18:20 - Carla Juvin, Emmanuel Hebrard, Laurent Houssin, Pierre Lopez:
An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling. 19:1-19:16 - Roger Kameugne, Sévérine Betmbe Fetgo, Thierry Noulamo, Clémentin Tayou Djamégni:
Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density. 20:1-20:17 - Matthias Klapperstueck, Frits de Nijs, Ilankaikone Senthooran, Jack Lee-Kopij, Maria Garcia de la Banda, Michael Wybrow:
Exploring Hydrogen Supply/Demand Networks: Modeller and Domain Expert Views. 21:1-21:18 - Petr Kucera:
Binary Constraint Trees and Structured Decomposability. 22:1-22:19 - Ryo Kuroiwa, J. Christopher Beck:
Large Neighborhood Beam Search for Domain-Independent Dynamic Programming. 23:1-23:22 - Steve Malalel, Arnaud Malapert, Marie Pelleau, Jean-Charles Régin:
MDD Archive for Boosting the Pareto Constraint. 24:1-24:15 - Tom Marty, Tristan François, Pierre Tessier, Louis Gautier, Louis-Martin Rousseau, Quentin Cappart:
Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver. 25:1-25:19 - Matthew J. McIlree, Ciaran McCreesh:
Proof Logging for Smart Extensional Constraints. 26:1-26:17 - Gioni Mexi, Timo Berthold, Ambros M. Gleixner, Jakob Nordström:
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. 27:1-27:19 - Xiao Peng, Christine Solnon:
Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming. 28:1-28:17 - Guillaume Perez, Gaël Glorian, Wijnand Suijlen, Arnaud Lallouet:
Distribution Optimization in Constraint Programming. 29:1-29:19 - Nikolaos Ploskas, Kostas Stergiou, Dimosthenis C. Tsouros:
The p-Dispersion Problem with Distance Constraints. 30:1-30:18 - Guillaume Povéda, Nahum Álvarez, Christian Artigues:
Partially Preemptive Multi Skill/Mode Resource-Constrained Project Scheduling with Generalized Precedence Relations and Calendars. 31:1-31:21 - Stéphanie Roussel, Thomas Polacsek, Anouck Chan:
Assembly Line Preliminary Design Optimization for an Aircraft. 32:1-32:19 - Pouya Shati, Eldan Cohen, Sheila A. McIlraith:
SAT-Based Learning of Compact Binary Decision Diagrams for Classification. 33:1-33:19 - Pierre Talbot, Tingting Hu, Nicolas Navet:
Constraint Programming with External Worst-Case Traversal Time Analysis. 34:1-34:20 - Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman:
Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming. 35:1-35:19 - Dimosthenis C. Tsouros, Senne Berden, Tias Guns:
Guided Bottom-Up Interactive Constraint Acquisition. 36:1-36:20 - Sameela Suharshani Wijesundara, Maria Garcia de la Banda, Guido Tack:
Addressing Problem Drift in UNHCR Fund Allocation. 37:1-37:18 - Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey:
From Formal Boosted Tree Explanations to Interpretable Rule Sets. 38:1-38:21 - Tianwei Zhang, Stefan Szeider:
Searching for Smallest Universal Graphs and Tournaments with SAT. 39:1-39:20 - Kexin Zheng, Ang Li, Han Zhang, T. K. Satish Kumar:
FastMapSVM for Predicting CSP Satisfiability. 40:1-40:17 - Wenbo Zhou, Yujiao Zhao, Yiyuan Wang, Shaowei Cai, Shimao Wang, Xinyu Wang, Minghao Yin:
Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization. 41:1-41:18 - Vincent Barbosa Vaz, James Bailey, Christopher Leckie, Peter J. Stuckey:
Predict-Then-Optimise Strategies for Water Flow Control (Short Paper). 42:1-42:10 - Kyle E. C. Booth:
Constraint Programming Models for Depth-Optimal Qubit Assignment and SWAP-Based Routing (Short Paper). 43:1-43:10 - Manuel Combarro Simón, Pierre Talbot, Grégoire Danoy, Jedrzej Musial, Mohammed Alswaitti, Pascal Bouvry:
Constraint Model for the Satellite Image Mosaic Selection Problem (Short Paper). 44:1-44:15 - Nicolas Golenvaux, Xavier Gillard, Siegfried Nijssen, Pierre Schaus:
Partitioning a Map into Homogeneous Contiguous Regions: A Branch-And-Bound Approach Using Decision Diagrams (Short Paper). 45:1-45:10 - Chungjae Lee, Wirattawut Boonbandansook, Vahid Eghbal Akhlaghi, Kevin Dalmeijer, Pascal Van Hentenryck:
Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks (Short Paper). 46:1-46:11 - Renee Mirka, Laura Greenstreet, Marc Grimson, Carla P. Gomes:
A New Approach to Finding 2 x n Partially Spatially Balanced Latin Rectangles (Short Paper). 47:1-47:11 - Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
Proven Optimally-Balanced Latin Rectangles with SAT (Short Paper). 48:1-48:10 - Andreas Plank, Sibylle Möhle, Martina Seidl:
Enumerative Level-2 Solution Counting for Quantified Boolean Formulas (Short Paper). 49:1-49:10
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 2025-02-20 19:50 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:
