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 566 matches
- 2024
- David Cushing, David I. Stewart:
Applying constraint programming to minimal lottery designs. Constraints An Int. J. 29(1): 1-21 (2024) - Joan Espasa, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret:
Plotting: a case study in lifted planning with constraints. Constraints An Int. J. 29(1): 40-79 (2024) - Arnold Hien, Noureddine Aribi, Samir Loudni, Yahia Lebbah, Abdelkader Ouali, Albrecht Zimmermann:
Mining diverse sets of patterns with constraint programming using the pairwise Jaccard similarity relaxation. Constraints An Int. J. 29(1): 80-111 (2024) - Michel Medema, Luc Breeman, Alexander Lazovik:
Limiting the memory consumption of caching for detecting subproblem dominance in constraint problems. Constraints An Int. J. 29(1): 152-191 (2024) - Maxime Mulamba, Jayanta Mandi, Ali Irfan Mahmutogullari, Tias Guns:
Perception-based constraint solving for sudoku images. Constraints An Int. J. 29(1): 112-151 (2024) - Andreas Plank, Sibylle Möhle, Martina Seidl:
Counting QBF solutions at level two. Constraints An Int. J. 29(1): 22-39 (2024) - Fabio Tardivo, Agostino Dovier, Andrea Formisano, Laurent Michel, Enrico Pontelli:
Constraint propagation on GPU: a case study for the cumulative constraint. Constraints An Int. J. 29(1): 192-214 (2024) - 2023
- Edward Lam:
Hybrid optimization of vehicle routing problems. Constraints An Int. J. 28(2): 67-68 (2023) - Utku Umur Acikalin, Bugra Çaskurlu, K. Subramani:
Security-Aware Database Migration Planning. Constraints An Int. J. 28(3): 472-505 (2023) - Christian Bessiere, Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
Complexity of minimum-size arc-inconsistency explanations. Constraints An Int. J. 28(3): 427-449 (2023) - Gustav Björdal:
From declarative models to local search. Constraints An Int. J. 28(3): 508-509 (2023) - Manuel Bodirsky, Jakub Bulín, Florian Starke, Michael Wernthaler:
The smallest hard trees. Constraints An Int. J. 28(2): 105-137 (2023) - Kyle E. C. Booth:
Constraint programming approaches to electric vehicle and robot routing problems. Constraints An Int. J. 28(3): 506-507 (2023) - Justin J. Boutilier, Carla Michini, Zachary Zhou:
Optimal multivariate decision trees. Constraints An Int. J. 28(4): 549-577 (2023) - Jordi Coll Caballero:
Scheduling through logic-based tools. Constraints An Int. J. 28(3): 510 (2023) - Rocsildes Canoy, Víctor Bucarey, Jayanta Mandi, Tias Guns:
Learn and route: learning implicit preferences for vehicle routing. Constraints An Int. J. 28(3): 363-396 (2023) - Margarita P. Castro:
Optimization methods based on decision diagrams for constraint programming, AI planning, and mathematical programming. Constraints An Int. J. 28(3): 511-512 (2023) - Mohamed Sami Cherif:
Reasoning and inference for (Maximum) satisfiability: new insights. Constraints An Int. J. 28(3): 513-514 (2023) - Ágnes Cseh, Guillaume Escamocher, Luis Quesada:
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. Constraints An Int. J. 28(2): 138-165 (2023) - Tomás Dlask:
Block-coordinate descent and local consistencies in linear programming. Constraints An Int. J. 28(2): 69-70 (2023) - Tomás Dlask, Tomás Werner:
Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs. Constraints An Int. J. 28(2): 244-276 (2023) - Tomás Dlask, Tomás Werner, Simon de Givry:
Super-reparametrizations of weighted CSPs: properties and optimization perspective. Constraints An Int. J. 28(2): 277-319 (2023) - Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
CSP beyond tractable constraint languages. Constraints An Int. J. 28(3): 450-471 (2023) - Rémy Garcia:
Floating-point numbers round-off error analysis by constraint programming. Constraints An Int. J. 28(3): 515 (2023) - Anissa Kheireddine, Etienne Renault, Souheib Baarir:
Towards better heuristics for solving bounded model checking problems. Constraints An Int. J. 28(1): 45-66 (2023) - Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, Felix Winter:
Exact methods for the Oven Scheduling Problem. Constraints An Int. J. 28(2): 320-361 (2023) - Ilankaikone Senthooran, Matthias Klapperstück, Gleb Belov, Tobias Czauderna, Kevin Leo, Mark Wallace, Michael Wybrow, Maria Garcia de la Banda:
Human-centred feasibility restoration in practice. Constraints An Int. J. 28(2): 203-243 (2023) - Pouya Shati, Eldan Cohen, Sheila A. McIlraith:
SAT-based optimal classification trees for non-binary data. Constraints An Int. J. 28(2): 166-202 (2023) - Rustem Takhanov:
The algebraic structure of the densification and the sparsification tasks for CSPs. Constraints An Int. J. 28(1): 13-44 (2023) - Pierre Talbot:
Spacetime programming: a synchronous language for constraint search. Constraints An Int. J. 28(3): 516-517 (2023)
skipping 536 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-12-19 19:24 CET 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