default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvoCOP 2004: Coimbra, Portugal
- Jens Gottlieb, Günther R. Raidl:
Evolutionary Computation in Combinatorial Optimization, 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings. Lecture Notes in Computer Science 3004, Springer 2004, ISBN 3-540-21367-8
EvoCOP Contributions
- Adnan Acan:
Mutation Multiplicity in a Panmictic Two-Strategy Genetic Algorithm. 1-10 - Enrique Alba, Bernabé Dorronsoro:
Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms. 11-20 - Christian Bierwirth, Dirk C. Mattfeld, Jean-Paul Watson:
Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem. 21-30 - Wouter Boomsma:
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem. 31-40 - Boris Brugger, Karl Doerner, Richard F. Hartl
, Marc Reimann:
AntPacking - An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem. 41-50 - Carlos Cotta:
Scatter Search and Memetic Approaches to the Error Correcting Code Problem. 51-61 - Betül Demiröz, Haluk Topcuoglu, Mahmut T. Kandemir:
A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem. 62-71 - Karl Doerner, Richard F. Hartl, Guenter Kiechle, Mária Lucká, Marc Reimann:
Parallel Ant Systems for the Capacitated Vehicle Routing Problem. 72-83 - Abraham Duarte, Felipe Fernández, Ángel Sánchez, Antonio S. Montemayor:
A Hierarchical Social Metaheuristic for the Max-Cut Problem. 84-94 - Thomas M. English:
On the Structure of Sequential Search: Beyond "No Free Lunch". 95-103 - Álvaro Gomes, Carlos Henggeler Antunes, Antonio Gomes Martins:
Dealing with Solution Diversity in an EA for Multiple Objective Decision Support - A Case Study. 104-113 - Jano I. van Hemert, Christine Solnon:
A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems. 114-123 - István Juhos, Attila Tóth, Jano I. van Hemert:
Binary Merge Model Representation of the Graph Colouring Problem. 124-134 - Philipp Kostuch, Krzysztof Socha:
Hardness Prediction for the University Course Timetabling Problem. 135-144 - Hui Li, Qingfu Zhang, Edward P. K. Tsang, John A. Ford:
Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack Problem. 145-154 - Melquíades Pérez Pérez, Francisco Almeida, J. Marcos Moreno-Vega:
On the Use of Path Relinking for the rho-Hub Median Problem. 155-164 - Jakob Puchinger, Günther R. Raidl, Gabriele Koller:
Solving a Real-World Glass Cutting Problem. 165-176 - Dirk Reichelt, Franz Rothlauf, Peter Gmilkowsky:
Designing Reliable Communication Networks with a Genetic Algorithm Using a Repair Heuristic. 177-187 - Samer Sa'adah, Peter Ross, Ben Paechter:
Improving Vehicle Routing Using a Customer Waiting Time Colony. 188-198 - Thomas Stützle, Susana Fernandes:
New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms. 199-209 - Chuan-Kang Ting:
Improving Edge Recombination through Alternate Inheritance and Greedy Manner. 210-219 - Laetitia Vermeulen-Jourdan, Clarisse Dhaenens, El-Ghazali Talbi:
Clustering Nominal and Numerical Data: A New Distance Concept for a Hybrid Genetic Algorithm. 220-229 - Benjamin Weinberg, El-Ghazali Talbi:
On Search Space Symmetry in Partitioning Problems. 230-240
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.
last updated on 2024-11-08 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
