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 32 matches
- 2004
- Gautam Appa, Dimitris Magos, Ioannis Mourtos:
LP Relaxations of Multiple all_different Predicates. CPAIOR 2004: 364-369 - Ionut D. Aron, John N. Hooker, Tallys H. Yunes:
SIMPL: A System for Integrating Optimization Techniques. CPAIOR 2004: 21-36 - Christian Artigues, Sana Belmokhtar, Dominique Feillet:
A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times. CPAIOR 2004: 37-49 - J. Christopher Beck, Eugene C. Freuder:
Simple Rules for Low-Knowledge Algorithm Selection. CPAIOR 2004: 50-64 - Nicolas Beldiceanu, Irit Katriel, Sven Thiel:
Filtering Algorithms for the Same Constraint. CPAIOR 2004: 65-79 - Nicolas Beldiceanu, Thierry Petit:
Cost Evaluation of Soft Global Constraints. CPAIOR 2004: 80-95 - Alberto Bemporad, Nicolò Giorgetti:
SAT-Based Branch & Bound and Optimal Control of Hybrid Dynamical Systems. CPAIOR 2004: 96-111 - Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim:
Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming. CPAIOR 2004: 112-126 - Yingyi Chu, Quanshi Xia:
Generating Benders Cuts for a General Class of Integer Programming Problems. CPAIOR 2004: 127-141 - Ayoub Insa Corréa, André Langevin, Louis-Martin Rousseau:
Dispatching and Conflict-Free Routing of Automated Guided Vehicles: A Hybrid Approach Combining Constraint Programming and Mixed Integer Programming. CPAIOR 2004: 370-379 - Cormac Gebruers, Alessio Guerri, Brahim Hnich, Michela Milano:
Making Choices Using Structure at the Instance Level within a Case Based Reasoning Framework. CPAIOR 2004: 380-386 - Carla P. Gomes, Meinolf Sellmann, Cindy van Es, Harold van Es:
The Challenge of Generating Spatially Balanced Scientific Experiment Designs. CPAIOR 2004: 387-394 - Mattias Grönkvist:
A Constraint Programming Model for Tail Assignment. CPAIOR 2004: 142-156 - Emmanuel Hebrard, Brahim Hnich, Toby Walsh:
Super Solutions in Constraint Programming. CPAIOR 2004: 157-172 - Pascal Van Hentenryck, Laurent Michel:
Scheduling Abstractions for Local Search. CPAIOR 2004: 319-334 - Olli Kamarainen, Hani El Sakkout:
Local Probing Applied to Network Routing. CPAIOR 2004: 173-189 - Irit Katriel:
Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights. CPAIOR 2004: 190-199 - Waldemar Kocjan, Per Kreuger:
Filtering Methods for Symmetric Cardinality Constraint. CPAIOR 2004: 200-208 - Olivier Lhomme:
Arc-Consistency Filtering Algorithms for Logical Combinations of Constraints. CPAIOR 2004: 209-224 - Christos T. Maravelias, Ignacio E. Grossmann:
Using MILP and CP for the Scheduling of Batch Chemical Processes. CPAIOR 2004: 1-20 - Laurent Perron, Paul Shaw:
Combining Forces to Solve the Car Sequencing Problem. CPAIOR 2004: 225-239 - Cédric Pralet, Gérard Verfaillie:
Travelling in the World of Local Searches in the Space of Partial Assignments. CPAIOR 2004: 240-255 - Gerrit Renker, Hatem Ahriz:
Building Models through Formal Specification. CPAIOR 2004: 395-401 - Cristina Ribeiro, Maria Antónia Carravilla:
A Global Constraint for Nesting Problems. CPAIOR 2004: 256-270 - Louis-Martin Rousseau:
Stabilization Issues for Constraint Programming Based Column Generation. CPAIOR 2004: 402-408 - Ruslan Sadykov:
A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem. CPAIOR 2004: 409-415 - Barbara M. Smith, Karen E. Petrie, Ian P. Gent:
Models and Symmetry Breaking for 'Peaceable Armies of Queens'. CPAIOR 2004: 271-286 - Sébastien Sorlin, Christine Solnon:
A Global Constraint for Graph Isomorphism Problems. CPAIOR 2004: 287-302 - Armagan Tarim, Ian Miguel:
Echelon Stock Formulation of Arborescent Distribution Systems: An Application to the Wagner-Whitin Problem. CPAIOR 2004: 302-318 - Petr Vilím:
O(n log n) Filtering Algorithms for Unary Resource Constraint. CPAIOR 2004: 335-347
skipping 2 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-10-02 21:10 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