Остановите войну!
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 27 matches
- 2012
- Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
A Contractor Based on Convex Interval Taylor. CPAIOR 2012: 1-16 - Sébastien Bardin, Arnaud Gotlieb:
fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays. CPAIOR 2012: 17-33 - David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker:
Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem. CPAIOR 2012: 34-49 - David Bergman, John N. Hooker:
Graph Coloring Facets from All-Different Systems. CPAIOR 2012: 50-65 - Jean-Charles Billaut, Emmanuel Hebrard, Pierre Lopez:
Complete Characterization of Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem. CPAIOR 2012: 66-80 - Alessio Bonfietti, Michele Lombardi, Luca Benini, Michela Milano:
Global Cyclic Cumulative Constraint. CPAIOR 2012: 81-96 - Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
A Computational Geometry-Based Local Search Algorithm for Planar Location Problems. CPAIOR 2012: 97-112 - Gilles Chabert, Sophie Demassey:
The Conjunction of Interval Among Constraints. CPAIOR 2012: 113-128 - André A. Ciré, Elvin Coban, Willem Jan van Hoeve:
Flow-Based Combinatorial Chance Constraints. CPAIOR 2012: 129-145 - Nicholas Downing, Thibaut Feydy, Peter J. Stuckey:
Explaining Flow-Based Propagation. CPAIOR 2012: 146-162 - Tommy Färnqvist:
Constraint Optimization Problems and Bounded Tree-Width Revisited. CPAIOR 2012: 163-179 - Daniel Fontaine, Laurent Michel:
A High Level Language for Solver Independent Model Manipulation and Generation of Hybrid Solvers. CPAIOR 2012: 180-194 - Graeme Gange, Peter J. Stuckey:
Explaining Propagators for s-DNNF Circuits. CPAIOR 2012: 195-210 - Stefan Heinz, J. Christopher Beck:
Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling. CPAIOR 2012: 211-227 - Yuri Malitsky, Meinolf Sellmann:
Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 - Florence Massen, Yves Deville, Pascal Van Hentenryck:
Pheromone-Based Heuristic Column Generation for Vehicle Routing Problems with Black Box Feasibility. CPAIOR 2012: 260-274 - Renaud Masson, Fabien Lehuédé, Olivier Péton:
Simple Temporal Problems in Route Scheduling for the Dial-a-Ride Problem with Transfers. CPAIOR 2012: 275-291 - Laurent Michel, Pascal Van Hentenryck:
Activity-Based Search for Black-Box Constraint Programming Solvers. CPAIOR 2012: 228-243 - Quang-Dung Pham, Yves Deville:
Solving the Longest Simple Path Problem with Constraint-Based Techniques. CPAIOR 2012: 292-306 - Aníbal Ponte, Luís Paquete, José Rui Figueira:
On Beam Search for Multicriteria Combinatorial Optimization Problems. CPAIOR 2012: 307-321 - Cédric Pralet, Gérard Verfaillie:
Combining Static and Dynamic Models for Boosting Forward Planning. CPAIOR 2012: 322-338 - Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann, Jakob Puchinger, Günther R. Raidl:
Hybrid Heuristics for Multimodal Homecare Scheduling. CPAIOR 2012: 339-355 - Ashish Sabharwal, Horst Samulowitz, Chandra Reddy:
Guiding Combinatorial Optimization with UCT. CPAIOR 2012: 356-361 - Andreas Schutt, Geoffrey Chu, Peter J. Stuckey, Mark G. Wallace:
Maximising the Net Present Value for Resource-Constrained Project Scheduling. CPAIOR 2012: 362-378 - Ben Simon, Carleton Coffrin, Pascal Van Hentenryck:
Randomized Adaptive Vehicle Decomposition for Large-Scale Power Restoration. CPAIOR 2012: 379-394 - Yang Wang, Zhipeng Lü, Fred W. Glover, Jin-Kao Hao:
A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization. CPAIOR 2012: 395-408 - Nicolas Beldiceanu, Narendra Jussien, Eric Pinson:
Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - 9th International Conference, CPAIOR 2012, Nantes, France, May 28 - June1, 2012. Proceedings. Lecture Notes in Computer Science 7298, Springer 2012, ISBN 978-3-642-29827-1 [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-05-24 19:08 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