Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 51 matches
- 2023
- Stéphanie Roussel, Thomas Polacsek, Anouck Chan:
Assembly Line Preliminary Design Optimization for an Aircraft. CP 2023: 32:1-32:19 - Ryo Kuroiwa, J. Christopher Beck:
Large Neighborhood Beam Search for Domain-Independent Dynamic Programming. CP 2023: 23:1-23:22 - João Araújo, Choiwah Chow, Mikolás Janota:
Symmetries for Cube-And-Conquer in Finite Model Finding. CP 2023: 8:1-8:19 - Younes Aalian, Gilles Pesant, Michel Gamache:
Optimization of Short-Term Underground Mine Planning Using Constraint Programming. CP 2023: 6:1-6:16 - Josep Alòs, Carlos Ansótegui, Josep M. Salvia, Eduard Torres:
Exploiting Configurations of MaxSAT Solvers. CP 2023: 7:1-7:16 - Gilles Audemard, Christophe Lecoutre, Charles Prud'homme:
Guiding Backtrack Search by Tracking Variables During Constraint Propagation. CP 2023: 9:1-9:17 - Maria Garcia de la Banda:
Beyond Optimal Solutions for Real-World Problems (Invited Talk). CP 2023: 1:1-1:4 - Aymeric Beauchamp, Thi-Bich-Hanh Dao, Samir Loudni, Christel Vrain:
Incremental Constrained Clustering by Minimal Weighted Modification. CP 2023: 10:1-10:22 - Ignace Bleukx, Jo Devriendt, Emilio Gamba, Bart Bogaerts, Tias Guns:
Simplifying Step-Wise Explanation Sequences. CP 2023: 11:1-11:20 - Kyle E. C. Booth:
Constraint Programming Models for Depth-Optimal Qubit Assignment and SWAP-Based Routing (Short Paper). CP 2023: 43:1-43:10 - Yi Chu, Shaowei Cai, Chuan Luo, Zhendong Lei, Cong Peng:
Towards More Efficient Local Search for Pseudo-Boolean Optimization. CP 2023: 12:1-12:18 - Vianney Coppé, Xavier Gillard, Pierre Schaus:
Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic Programming. CP 2023: 13:1-13:17 - Arnaud Deza, Chang Liu, Pashootan Vaezipoor, Elias B. Khalil:
Fast Matrix Multiplication Without Tears: A Constraint Programming Approach. CP 2023: 14:1-14:15 - Alexandre Dubray, Pierre Schaus, Siegfried Nijssen:
Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses. CP 2023: 15:1-15:17 - Yousra El Ghazi, Djamal Habet, Cyril Terrioux:
A CP Approach for the Liner Shipping Network Design Problem. CP 2023: 16:1-16:21 - 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). CP 2023: 45:1-45:10 - Arnoosh Golestanian, Giovanni Lo Bianco, Chengyu Tao, J. Christopher Beck:
Optimization Models for Pickup-And-Delivery Problems with Reconfigurable Capacities. CP 2023: 17:1-17:17 - Christoph Jabs, Jeremias Berg, Hannes Ihalainen, Matti Järvisalo:
Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization. CP 2023: 18:1-18:20 - Carla Juvin, Emmanuel Hebrard, Laurent Houssin, Pierre Lopez:
An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling. CP 2023: 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. CP 2023: 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. CP 2023: 21:1-21:18 - Petr Kucera:
Binary Constraint Trees and Structured Decomposability. CP 2023: 22:1-22:19 - Jimmy H. M. Lee:
A Tale of Two Cities: Teaching CP with Story-Telling (Invited Talk). CP 2023: 2:1-2:1 - 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). CP 2023: 46:1-46:11 - Steve Malalel, Arnaud Malapert, Marie Pelleau, Jean-Charles Régin:
MDD Archive for Boosting the Pareto Constraint. CP 2023: 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. CP 2023: 25:1-25:19 - Matthew J. McIlree, Ciaran McCreesh:
Proof Logging for Smart Extensional Constraints. CP 2023: 26:1-26:17 - Gioni Mexi, Timo Berthold, Ambros M. Gleixner, Jakob Nordström:
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. CP 2023: 27:1-27:19 - Renee Mirka, Laura Greenstreet, Marc Grimson, Carla P. Gomes:
A New Approach to Finding 2 x n Partially Spatially Balanced Latin Rectangles (Short Paper). CP 2023: 47:1-47:11 - Xiao Peng, Christine Solnon:
Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming. CP 2023: 28:1-28:17
skipping 21 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-09 09:53 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint