Остановите войну!
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 32 matches
- 2002
- Uwe Aickelin, Kathryn A. Dowsland:
Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem. J. Heuristics 8(5): 503-514 (2002) - Renata M. Aiex, Mauricio G. C. Resende, Celso C. Ribeiro:
Probability Distribution of Solution Time in GRASP: An Experimental Investigation. J. Heuristics 8(3): 343-373 (2002) - Ahmad A. Al-Yamani, Sadiq M. Sait, Habib Youssef, Hassan R. Barada:
Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations. J. Heuristics 8(3): 277-304 (2002) - Alexandre A. Andreatta, Celso C. Ribeiro:
Heuristics for the Phylogeny Problem. J. Heuristics 8(4): 429-447 (2002) - Eric Angel, Vassilis Zissimopoulos:
On the Hardness of the Quadratic Assignment Problem with Metaheuristics. J. Heuristics 8(4): 399-414 (2002) - Stefano Bistarelli, Ugo Montanari, Francesca Rossi:
Soft Constraint Logic Programming and Generalized Shortest Path Problems. J. Heuristics 8(1): 25-41 (2002) - Jacek Blazewicz, Marta Kasprzak, Wojciech Kuroczycki:
Hybrid Genetic Algorithm for DNA Sequencing with Errors. J. Heuristics 8(5): 495-502 (2002) - Massimiliano Caramia, Paolo Dell'Olmo:
Constraint Propagation in Graph Coloring. J. Heuristics 8(1): 83-107 (2002) - Amedeo Cesta, Angelo Oddi, Stephen F. Smith:
A Constraint-Based Method for Project Scheduling with Time Windows. J. Heuristics 8(1): 109-136 (2002) - Marie-Christine Costa, Alain Hertz, Michel Mittaz:
Bounds and Heuristics for the Shortest Capacitated Paths Problem. J. Heuristics 8(4): 449-465 (2002) - Teodor Gabriel Crainic, Michel Gendreau:
Cooperative Parallel Tabu Search for Capacitated Network Design. J. Heuristics 8(6): 601-627 (2002) - Teodor Gabriel Crainic, Michel Toulouse:
Introduction to the Special Issue on Parallel Meta-Heuristics. J. Heuristics 8(3): 247-249 (2002) - Opher Dubrovsky, Gregory Levitin, Michal Penn:
A Genetic Algorithm with a Compact Solution Encoding for the Container Ship Stowage Problem. J. Heuristics 8(6): 585-599 (2002) - Torsten Fahle, Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Meinolf Sellmann, Bo Vaaben:
Constraint Programming Based Column Generation for Crew Assignment. J. Heuristics 8(1): 59-81 (2002) - Filippo Focacci, Andrea Lodi, Michela Milano:
Mathematical Programming Techniques in Constraint Programming: A Short Overview. J. Heuristics 8(1): 7-17 (2002) - Alan P. French, John M. Wilson:
Heuristic Solution Methods for the Multilevel Generalized Assignment Problem. J. Heuristics 8(2): 143-153 (2002) - Félix García-López, Belén Melián-Batista, José A. Moreno-Pérez, J. Marcos Moreno-Vega:
The Parallel Variable Neighborhood Search for the p-Median Problem. J. Heuristics 8(3): 375-388 (2002) - Hermann Gehring, Jörg Homberger:
Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows. J. Heuristics 8(3): 251-276 (2002) - Michel Gendreau:
Constraint Programming and Operations Research: Comments from an Operations Researcher. J. Heuristics 8(1): 19-24 (2002) - Diptesh Ghosh, Gerard Sierksma:
Complete Local Search with Memory. J. Heuristics 8(6): 571-584 (2002) - José Fernando Gonçalves, Jorge Raimundo de Almeida:
A Hybrid Genetic Algorithm for Assembly Line Balancing. J. Heuristics 8(6): 629-642 (2002) - Michael Kirley:
A Cellular Genetic Algorithm with Disturbances: Optimisation Using Dynamic Spatial Interactions. J. Heuristics 8(3): 321-342 (2002) - Mikhail Y. Kovalyov, Frank Werner:
Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness. J. Heuristics 8(4): 415-428 (2002) - Fen-Hui Lin, Way Kuo:
Reliability Importance and Invariant Optimal Allocation. J. Heuristics 8(2): 155-171 (2002) - C. K. Y. Lin, C. L. Wong, Y. C. Yeung:
Heuristic Approaches for a Scheduling Problem in the Plastic Molding Department of an Audio Company. J. Heuristics 8(5): 515-540 (2002) - Peter Merz, Bernd Freisleben:
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming. J. Heuristics 8(2): 197-213 (2002) - Martin Middendorf, Frank Reischle, Hartmut Schmeck:
Multi Colony Ant Algorithms. J. Heuristics 8(3): 305-320 (2002) - Louis-Martin Rousseau, Michel Gendreau, Gilles Pesant:
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows. J. Heuristics 8(1): 43-58 (2002) - F. Sibel Salman, Jayant Kalagnanam, Sesh Murthy, Andrew J. Davenport:
Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem. J. Heuristics 8(2): 215-239 (2002) - Prabha Sharma:
Permutation Polyhedra and Minimisation of the Variance of Completion Times on a Single Machine. J. Heuristics 8(4): 467-485 (2002)
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-05-11 10:59 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