Остановите войну!
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 33 matches
- 2017
- Michael Abseher, Nysret Musliu, Stefan Woltran:
htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond. CPAIOR 2017: 376-386 - Murodzhon Akhmedov, Alexander LeNail, Francesco Bertoni, Ivo Kwee, Ernest Fraenkel, Roberto Montemanni:
A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks. CPAIOR 2017: 263-276 - Junwen Bai, Johan Bjorck, Yexiang Xue, Santosh K. Suram, John M. Gregoire, Carla P. Gomes:
Relaxation Methods for Constrained Matrix Factorization Problems: Solving the Phase Mapping Problem in Materials Discovery. CPAIOR 2017: 104-112 - Omid Sanei Bajgiran, André A. Ciré, Louis-Martin Rousseau:
A First Look at Picking Dual Variables for Maximizing Reduced Cost Fixing. CPAIOR 2017: 221-228 - Nicolas Beldiceanu, Mats Carlsson, Alban Derrien, Charles Prud'homme, Andreas Schutt, Peter J. Stuckey:
Range-Consistent Forbidden Regions of Allen's Relations. CPAIOR 2017: 21-29 - David Bergman, André Augusto Ciré:
On Finding the Optimal BDD Relaxation. CPAIOR 2017: 41-50 - Natashia Boland, Mike Hewitt, Duc Minh Vu, Martin W. P. Savelsbergh:
Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks. CPAIOR 2017: 254-262 - Quentin Cappart, Pierre Schaus:
Rescheduling Railway Traffic on Real Time Situations Using Time-Interval Variables. CPAIOR 2017: 312-327 - Zakaria Chihani, Bruno Marre, François Bobot, Sébastien Bardin:
Sharpening Constraint Programming Approaches for Bit-Vector Theory. CPAIOR 2017: 3-20 - Antoine Delaite, Gilles Pesant:
Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems. CPAIOR 2017: 176-184 - Mateo Díaz, Ronan Le Bras, Carla P. Gomes:
In Search of Balance: The Challenge of Generating Balanced Latin Rectangles. CPAIOR 2017: 68-76 - Mirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems. CPAIOR 2017: 403-418 - Emmanuel Hebrard, Mohamed Siala:
Explanation-Based Weighted Degree. CPAIOR 2017: 167-175 - David Hemmi, Guido Tack, Mark Wallace:
Scenario-Based Learning for Stochastic Combinatorial Optimisation. CPAIOR 2017: 277-292 - Vinasétan Ratheil Houndji, Pierre Schaus, Mahouton Norbert Hounkonnou, Laurence A. Wolsey:
The Weighted Arborescence Constraint. CPAIOR 2017: 185-201 - Lucas Kletzander, Nysret Musliu:
A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem. CPAIOR 2017: 344-358 - Markus Kruber, Marco E. Lübbecke, Axel Parmentier:
Learning When to Use a Decomposition. CPAIOR 2017: 202-210 - Kevin Leo, Guido Tack:
Debugging Unsatisfiable Constraint Models. CPAIOR 2017: 77-93 - Maël Minot, Samba Ndojh Ndiaye, Christine Solnon:
Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring Problem. CPAIOR 2017: 359-375 - Kiriakos-Simon Mountakis, Tomas Klos, Cees Witteveen:
Stochastic Task Networks - Trading Performance for Stability. CPAIOR 2017: 302-311 - Kiriakos-Simon Mountakis, Tomas Klos, Cees Witteveen:
Dynamic Temporal Decoupling. CPAIOR 2017: 328-343 - Guillaume Perez, Jean-Charles Régin:
MDDs are Efficient Modeling Tools: An Application to Some Statistical Constraints. CPAIOR 2017: 30-40 - Joseph D. Scott, Pierre Flener, Justin Pearson, Christian Schulte:
Design and Implementation of Bounded-Length Sequence Variables. CPAIOR 2017: 51-67 - Emily Speakman, Han Yu, Jon Lee:
Experimental Validation of Volume-Based Comparison for Double-McCormick Relaxations. CPAIOR 2017: 229-243 - Diego de Uña, Graeme Gange, Peter Schachte, Peter J. Stuckey:
Minimizing Landscape Resistance for Habitat Conservation. CPAIOR 2017: 113-130 - Sicco Verwer, Yingqian Zhang:
Learning Decision Trees with Flexible Constraints and Objectives Using Integer Optimization. CPAIOR 2017: 94-103 - Mohamed Wahbi, Diarmuid Grimes, Deepak Mehta, Kenneth N. Brown, Barry O'Sullivan:
A Distributed Optimization Method for the Geographically Distributed Data Centres Problem. CPAIOR 2017: 147-166 - Jakob Witzig, Timo Berthold, Stefan Heinz:
Experiments with Conflict Analysis in Mixed Integer Programming. CPAIOR 2017: 211-220 - Hong Xu, T. K. Satish Kumar, Sven Koenig:
The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP. CPAIOR 2017: 387-402 - Miao Yu, Viswanath Nagarajan, Siqian Shen:
Minimum Makespan Vehicle Routing Problem with Compatibility Constraints. CPAIOR 2017: 244-253
skipping 3 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-03 14:49 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