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 16 matches
- 2024
- Emir Demirovic, Ciaran McCreesh, Matthew J. McIlree, Jakob Nordström, Andy Oertel, Konstantin Sidorov:
Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms. CP 2024: 9:1-9:21 - 2022
- Endre Boros, Joonhee Lee:
Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions. ISAIM 2022 - 2021
- Jo Devriendt, Ambros M. Gleixner, Jakob Nordström:
Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search. Constraints An Int. J. 26(1): 26-55 (2021) - 2016
- Michael Winkler:
Solving Non-Linear Pseudo-Boolean Optimization Problems by Constraint Integer Programming. ISAIM 2016 - 2012
- Oana Ruxandra Tuns:
Bilevel Biobjective Pseudo Boolean Programming Problems. J. Math. Model. Algorithms 11(3): 325-344 (2012) - 2009
- Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette:
Pseudo Boolean Programming for Partially Ordered Genomes. RECOMB-CG 2009: 126-137 - 2007
- Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette:
A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. RECOMB-CG 2007: 16-29 - 2006
- Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette:
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. Comparative Genomics 2006: 75-86 - 1994
- Alexander Bockmayr:
Solving Pseudo-Boolean Constraints. Constraint Programming 1994: 22-38 - 1993
- Frédéric Benhamou, Jean-Luc Massat:
Boolean Pseudo-equations in Constraint Logic Programming. ICLP 1993: 517-531 - 1991
- Pramode Ranjan Bhattacharjee, Sanjoy Kumar Basu, Jogesh Chandra Paul:
Translation of the Problem of Complete Test Set Generation to Pseudo-Boolean Programming. IEEE Trans. Computers 40(7): 864-867 (1991) - Alexander Bockmayr:
Logic Programming with Pseudo-Boolean Constraints. WCLP 1991: 327-350 - 1990
- Yves Crama, Pierre Hansen, Brigitte Jaumard:
The basic algorithm for pseudo-Boolean programming revisited. Discret. Appl. Math. 29(2-3): 171-185 (1990) - 1977
- Spiros G. Papaioannou:
Optimal Test Generation in Combinational Networks by Pseudo-Boolean Programming. IEEE Trans. Computers 26(6): 553-560 (1977) - 1973
- Stanislaw Walukiewicz, Leon Slominski, Marian Faner:
An Improved Algorithm for Pseudo-Boolean Programming. Optimization Techniques 1973: 493-504 - 1969
- Peter L. Hammer, Sergiu Rudeanu:
Pseudo-Boolean Programming. Oper. Res. 17(2): 233-261 (1969)
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-10-28 22:13 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