Остановите войну!
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 44 matches
- 2008
- Tobias Achterberg, Timo Berthold, Thorsten Koch, Kati Wolter:
Constraint Integer Programming: A New Approach to Integrate CP and MIP. CPAIOR 2008: 6-20 - Tobias Achterberg, Stefan Heinz, Thorsten Koch:
Counting Solutions of Integer Programs Using Unrestricted Subtree Detection. CPAIOR 2008: 278-282 - Douglas S. Altner, Özlem Ergun:
Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts. CPAIOR 2008: 283-287 - Ada Barlatt, Amy Mainville Cohn, Oleg Yu. Gusikhin:
A Hybrid Approach for Solving Shift-Selection and Task-Sequencing Problems. CPAIOR 2008: 288-292 - Cynthia Barnhart:
Airline Scheduling: Accomplishments, Opportunities and Challenges. CPAIOR 2008: 1 - Nicolas Beldiceanu, Mats Carlsson, Emmanuel Poder:
New Filtering for the cumulative Constraint in the Context of Non-Overlapping Rectangles. CPAIOR 2008: 21-35 - Luca Benini, Michele Lombardi, Marco Mantovani, Michela Milano, Martino Ruggiero:
Multi-stage Benders Decomposition for Optimizing Multicore Architectures. CPAIOR 2008: 36-50 - Hadrien Cambazard, John Horan, Eoin O'Mahony, Barry O'Sullivan:
Fast and Scalable Domino Portrait Generation. CPAIOR 2008: 51-65 - Grégoire Dooms, Pascal Van Hentenryck:
Gap Reduction Techniques for Online Stochastic Project Scheduling. CPAIOR 2008: 66-81 - Alex S. Fukunaga:
Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver. CPAIOR 2008: 82-96 - Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant:
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. CPAIOR 2008: 298-302 - Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal:
Connections in Networks: A Hybrid Approach. CPAIOR 2008: 303-307 - Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira:
Efficient Haplotype Inference with Combined CP and OR Techniques. CPAIOR 2008: 308-312 - Birgit Grohe, Dag Wedelin:
Cost Propagation - Numerical Propagation for Optimization Problems. CPAIOR 2008: 97-111 - Boris Gutkovich:
Integration of CP and Compilation Techniques for Instruction Sequence Test Generation. CPAIOR 2008: 313-317 - Nizar El Hachemi, Michel Gendreau, Louis-Martin Rousseau:
Solving a Log-Truck Scheduling Problem with Constraint Programming. CPAIOR 2008: 293-297 - Tarik Hadzic, John N. Hooker, Peter Tiedemann:
Propagating Separable Equalities in an MDD Store. CPAIOR 2008: 318-322 - Ivan Heckman, J. Christopher Beck:
Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs. CPAIOR 2008: 112-126 - Pascal Van Hentenryck:
30 Years of Constraint Programming. CPAIOR 2008: 5 - Pascal Van Hentenryck, Laurent Michel:
The Steel Mill Slab Design Problem Revisited. CPAIOR 2008: 377-381 - Willem Jan van Hoeve, Ashish Sabharwal:
Filtering Atmost1 on Pairs of Set Variables. CPAIOR 2008: 382-386 - George Katsirelos, Nina Narodytska, Toby Walsh:
The Weighted CfgConstraint. CPAIOR 2008: 323-327 - Madjid Khichane, Patrick Albert, Christine Solnon:
CP with ACO. CPAIOR 2008: 328-332 - Lukas Kroc, Ashish Sabharwal, Bart Selman:
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. CPAIOR 2008: 127-141 - François Laburthe:
Selected Challenges from Distribution and Commerce in the Airline and Travel Industry. CPAIOR 2008: 2-4 - Hoong Chuin Lau, Kong Wei Lye, Viet Bang Nguyen:
A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract). CPAIOR 2008: 333-337 - Daniel H. Leventhal, Meinolf Sellmann:
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems. CPAIOR 2008: 142-157 - Paul Maier, Martin Sachenbacher:
Constraint Optimization and Abstraction for Embedded Intelligent Systems. CPAIOR 2008: 338-342 - Christopher Mears, Maria J. García de la Banda, Mark Wallace, Bart Demoen:
A Novel Approach For Detecting Symmetries in CSP Models. CPAIOR 2008: 158-172 - Luc Mercier, Pascal Van Hentenryck:
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization. CPAIOR 2008: 173-187
skipping 14 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-26 03:29 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