Остановите войну!
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 28 matches
- 2004
- Michael Affenzeller, Stefan Wagner:
SASEGASA: A New Generic Parallel Evolutionary Algorithm for Achieving Highest Quality Results. J. Heuristics 10(3): 243-267 (2004) - Enrique Alba:
Introduction. J. Heuristics 10(3): 239-241 (2004) - Adriana C. F. Alvim, Celso C. Ribeiro, Fred W. Glover, Dario J. Aloise:
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem. J. Heuristics 10(2): 205-229 (2004) - Vinícius Amaral Armentano, José Elias Claudio Arroyo:
An Application of a Multi-Objective Tabu Search Algorithm to a Bicriteria Flowshop Problem. J. Heuristics 10(5): 463-481 (2004) - Mehmet Emin Aydin, Terence C. Fogarty:
A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems. J. Heuristics 10(3): 269-292 (2004) - Raul Baños, Consolación Gil, Julio Ortega Lopera, Francisco G. Montoya:
A Parallel Multilevel Metaheuristic for Graph Partitioning. J. Heuristics 10(3): 315-336 (2004) - Olli Bräysy, Wout Dullaert, Michel Gendreau:
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows. J. Heuristics 10(6): 587-611 (2004) - Luciana S. Buriol, Paulo Morelato França, Pablo Moscato:
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem. J. Heuristics 10(5): 483-506 (2004) - Sébastien Cahon, Nordine Melab, El-Ghazali Talbi:
ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. J. Heuristics 10(3): 357-380 (2004) - Shan-Tai Chen, Shun-Shii Lin, Li-Te Huang, Chun-Jen Wei:
Towards the Exact Minimization of BDDs-An Elitism-Based Distributed Evolutionary Algorithm. J. Heuristics 10(3): 337-355 (2004) - Paulo Cortez, Miguel Rocha, José Neves:
Evolving Time Series Forecasting ARMA Models. J. Heuristics 10(4): 415-429 (2004) - Teodor Gabriel Crainic, Bernard Gendron, Geneviève Hernu:
A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design. J. Heuristics 10(5): 525-545 (2004) - Teodor Gabriel Crainic, Michel Gendreau, Pierre Hansen, Nenad Mladenovic:
Cooperative Parallel Variable Neighborhood Search for the p-Median. J. Heuristics 10(3): 293-314 (2004) - Federico Della Croce, Marco Ghirardi, Roberto Tadei:
Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems. J. Heuristics 10(1): 89-104 (2004) - Mauro Dell'Amico, Manuel Iori, Silvano Martello:
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem. J. Heuristics 10(2): 169-204 (2004) - Fernando Fernández, Pedro Isasi:
Evolutionary Design of Nearest Prototype Classifiers. J. Heuristics 10(4): 431-454 (2004) - Andrea Grosso, Marco Locatelli, Federico Della Croce:
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. J. Heuristics 10(2): 135-152 (2004) - Jano I. van Hemert, Thomas Bäck:
Robust Parameter Settings for Variation Operators by Measuring the Resampling Ratio: A Study on Binary Constraint Satisfaction Problems. J. Heuristics 10(6): 629-640 (2004) - Sheldon H. Jacobson, Enver Yücesan:
Analyzing the Performance of Generalized Hill Climbing Algorithms. J. Heuristics 10(4): 387-405 (2004) - Yong-Hyuk Kim, Byung Ro Moon:
Lock-Gain Based Graph Partitioning. J. Heuristics 10(1): 37-57 (2004) - Yong-Hyuk Kim, Byung Ro Moon:
Investigation of the Fitness Landscapes in Graph Bipartitioning: An Empirical Study. J. Heuristics 10(2): 111-133 (2004) - Masaya Mito, Satoshi Fujita:
On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions. J. Heuristics 10(5): 507-523 (2004) - Cristian Munteanu, Agostinho C. Rosa:
Adaptive Reservoir Evolutionary Algorithm: An Evolutionary On-Line Adaptation Scheme for Global Function Optimization. J. Heuristics 10(6): 555-586 (2004) - Michael Polacek, Richard F. Hartl, Karl Doerner, Marc Reimann:
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows. J. Heuristics 10(6): 613-627 (2004) - Mauricio G. C. Resende, Renato Fonseca F. Werneck:
A Hybrid Heuristic for the p-Median Problem. J. Heuristics 10(1): 59-88 (2004) - A. J. Richmond, John E. Beasley:
An Iterative Construction Heuristic for the Ore Selection Problem. J. Heuristics 10(2): 153-167 (2004) - H. Edwin Romeijn, Dolores Romero Morales:
Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem: The Acyclic Case. J. Heuristics 10(1): 5-35 (2004) - Michel Vasquez:
New Results on the Queens_n2 Graph Coloring Problem. J. Heuristics 10(4): 407-413 (2004)
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 21: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