![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 19 matches
- 2008
- Hernán E. Aguirre, Kiyoshi Tanaka:
Performance and Scalability of Genetic Algorithms on NK-Landscapes. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 37-52 - Enrique Alba
, Gabriel Luque
:
A Hybrid Genetic Algorithm for the DNA Fragment Assembly Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 101-112 - Prasanna Balaprakash
, Mauro Birattari
, Thomas Stützle
:
Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 53-66 - Francisco Ballestín:
Different Codifications and Metaheuristic Algorithms for the Resource Renting Problem with Minimum and Maximum Time Lags. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 187-202 - Matthew J. Craven
:
An Evolutionary Algorithm for the Solution of Two-Variable Word Equations in Partially Commutative Groups. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 3-19 - Susana Fernandes
, Helena R. Lourenço
:
A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 203-218 - Thomas Fischer, Peter Merz:
Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 243-258 - István Juhos, Jano I. van Hemert
:
Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 167-184 - Bryant A. Julstrom:
A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 295-307 - Nacima Labadi, Christian Prins, Mohamed Reghioui:
An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 275-294 - Francisco Luna
, Enrique Alba
, Antonio J. Nebro
, Salvador Pedraza:
Search Intensification in Metaheuristics for Solving the Automatic Frequency Problem in GSM. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 151-166 - Vittorio Maniezzo
, Matteo Roffilli
:
Algorithms for Large Directed Capacitated Arc Routing Problem Instances. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 259-274 - Nysret Musliu
:
An Iterative Heuristic Algorithm for Tree Decomposition. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 133-150 - Napoleão Nepomuceno
, Plácido Rogério Pinheiro, André L. V. Coelho
:
A Hybrid Optimization Framework for Cutting and Packing Problems. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 87-99 - Ferrante Neri
, Niko Kotilainen, Mikko Vapa:
A Memetic-Neural Approach to Discover Resources in P2P Networks. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 113-129 - Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger
:
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 69-85 - Enda Ridge, Daniel Kudenko:
Determining Whether a Problem Characteristic Affects Heuristic Performance. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 21-35 - Fatos Xhafa
, Bernat Duran:
Parallel Memetic Algorithms for Independent Job Scheduling in Computational Grids. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 219-239 - Carlos Cotta, Jano I. van Hemert:
Recent Advances in Evolutionary Computation for Combinatorial Optimization. Studies in Computational Intelligence 153, Springer 2008, ISBN 978-3-540-70806-3 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-07 21:17 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