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 25 matches
- 2006
- Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin:
Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem. EvoCOP 2006: 1-12 - Peter I. Cowling, Nic Colledge, Keshav P. Dahal, Stephen Remde:
The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling. EvoCOP 2006: 13-24 - Laura Diosan, Mihai Oltean:
Evolving the Structure of the Particle Swarm Optimization Algorithms. EvoCOP 2006: 25-36 - Herbert de Mélo Duarte, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg:
A Tabu Search Algorithm for Optimization of Gas Distribution Networks. EvoCOP 2006: 37-48 - Anna Esparcia-Alcázar, Lidia Lluch-Revert, Manuel Cardós, Ken Sharman, Carlos Andrés-Romano:
Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm. EvoCOP 2006: 49-60 - Armin Fügenschuh, Benjamin Höfler:
Parametrized GRASP Heuristics for Three-Index Assignment. EvoCOP 2006: 61-72 - José E. Gallardo, Carlos Cotta, Antonio J. Fernández:
A Memetic Algorithm with Bucket Elimination for the Still Life Problem. EvoCOP 2006: 73-85 - Mario Giacobini, Mike Preuss, Marco Tomassini:
Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA. EvoCOP 2006: 86-98 - Elizabeth Ferreira Gouvea Goldbarg, Givanaldo R. de Souza, Marco César Goldbarg:
Particle Swarm for the Traveling Salesman Problem. EvoCOP 2006: 99-110 - Stefan Janson, Enrique Alba, Bernabé Dorronsoro, Martin Middendorf:
Hierarchical Cellular Genetic Algorithm. EvoCOP 2006: 111-122 - István Juhos, Jano I. van Hemert:
Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation. EvoCOP 2006: 123-134 - Ali Husseinzadeh Kashan, Behrooz Karimi, Fariborz Jolai:
Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach. EvoCOP 2006: 135-146 - Britta Kehden, Frank Neumann:
A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems. EvoCOP 2006: 147-158 - Broos Maenhout, Mario Vanhoucke:
New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm. EvoCOP 2006: 159-170 - Yuichi Nagata:
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems. EvoCOP 2006: 171-182 - Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo:
A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem. EvoCOP 2006: 183-194 - Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy:
The Core Concept for the Multidimensional Knapsack Problem. EvoCOP 2006: 195-208 - Dirk Reichelt, Lars Mönch:
Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines. EvoCOP 2006: 209-221 - Daniel A. M. Rocha, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg:
A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem. EvoCOP 2006: 222-233 - Olfa Sammoud, Sébastien Sorlin, Christine Solnon, Khaled Ghédira:
A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems. EvoCOP 2006: 234-246 - Marc Schoenauer, Pierre Savéant, Vincent Vidal:
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning. EvoCOP 2006: 247-260 - Mehmet Sevkli, Mehmet Emin Aydin:
A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems. EvoCOP 2006: 261-271 - Mario Vanhoucke:
An Efficient Hybrid Search Algorithm for Various Optimization Problems. EvoCOP 2006: 272-283 - Gabriel Villa, Sebastián Lozano, Jesús Racero, David Canca:
A Hybrid VNS/Tabu Search Algorithm for Apportioning the European Parliament. EvoCOP 2006: 284-292 - Jens Gottlieb, Günther R. Raidl:
Evolutionary Computation in Combinatorial Optimization, 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings. Lecture Notes in Computer Science 3906, Springer 2006, ISBN 3-540-33178-6 [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-11-04 03:04 CET 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