Остановите войну!
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 30 matches
- 2005
- Magnus Ågren, Pierre Flener, Justin Pearson:
Set Variables and Local Search. CPAIOR 2005: 19-33 - Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian Miguel, Armagan Tarim, Chris Unsworth:
The Temporal Knapsack Problem and Its Solution. CPAIOR 2005: 34-48 - Andreas Bauer:
Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles. CPAIOR 2005: 49-63 - Nicolas Beldiceanu, Pierre Flener, Xavier Lorca:
The tree Constraint. CPAIOR 2005: 64-78 - Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh:
Filtering Algorithms for the NValue Constraint. CPAIOR 2005: 79-93 - Thomas Bousonville, Filippo Focacci, Claude Le Pape, Wim Nuijten, Frederic Paulin, Jean-Francois Puget, Anna Robert, Alireza Sadeghin:
Integration of Rules and Optimization in Plant PowerOps. CPAIOR 2005: 1-15 - Hadrien Cambazard, Narendra Jussien:
Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming. CPAIOR 2005: 94-109 - Yingyi Chu, Quanshi Xia:
A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems. CPAIOR 2005: 110-124 - Wilhelm Cronholm, Farid Ajili, Sofia Panagiotidi:
On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price. CPAIOR 2005: 125-139 - Sophie Demassey, Gilles Pesant, Louis-Martin Rousseau:
Constraint Programming Based Column Generation for Employee Timetabling. CPAIOR 2005: 140-154 - Iván Dotú, Pascal Van Hentenryck:
Scheduling Social Golfers Locally. CPAIOR 2005: 155-167 - Khaled M. Elbassioni, Irit Katriel:
Multiconsistency and Robustness with Global Constraints. CPAIOR 2005: 168-182 - Jeremy Frank, Elif Kürklü:
Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations. CPAIOR 2005: 183-200 - Thorsten Gellermann, Meinolf Sellmann, Robert Wright:
Shorter Path Constraints for the Resource Constrained Shortest Path Problem. CPAIOR 2005: 201-216 - Bernard Gendron, Hocine Lebbah, Gilles Pesant:
Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation. CPAIOR 2005: 217-227 - Jesper Hansen, Tomas Lidén:
Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch and Price. CPAIOR 2005: 228-242 - Pascal Van Hentenryck, Laurent Michel:
Nondeterministic Control for Hybrid Search. CPAIOR 2005: 380-395 - John N. Hooker:
A Search-Infer-and-Relax Framework for Integrating Solution Methods. CPAIOR 2005: 243-257 - Mohand Ou Idir Khemmoudj, Hachemi Bennaceur, Anass Nagih:
Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs. CPAIOR 2005: 258-272 - T. K. Satish Kumar:
On the Tractability of Smooth Constraint Satisfaction Problems. CPAIOR 2005: 304-319 - Paul Pop:
Embedded Systems Design: Optimization Challenges. CPAIOR 2005: 16-16 - Steven D. Prestwich, Andrea Roli:
Symmetry Breaking and Local Search Spaces. CPAIOR 2005: 273-287 - Jean-Charles Régin:
Combination of Among and Cardinality Constraints. CPAIOR 2005: 288-303 - Hossein M. Sheini, Karem A. Sakallah:
A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems. CPAIOR 2005: 320-335 - Barbara M. Smith:
Symmetry and Search in a Network Design Problem. CPAIOR 2005: 336-350 - Sathiamoorthy Subbarayan:
Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems. CPAIOR 2005: 351-365 - Michael A. Trick:
Formulations and Reformulations in Integer Programming. CPAIOR 2005: 366-379 - Petr Vilím:
Computing Explanations for the Unary Resource Constraint. CPAIOR 2005: 396-409 - H. Paul Williams:
Models for Solving the Travelling Salesman Problem. CPAIOR 2005: 17-18 - Roman Barták, Michela Milano:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 30 - June 1, 2005, Proceedings. Lecture Notes in Computer Science 3524, Springer 2005, ISBN 3-540-26152-4 [contents]
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-07-19 11:54 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