default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvoCOP 2016: Porto, Portugal
- Francisco Chicano
, Bin Hu, Pablo García-Sánchez:
Evolutionary Computation in Combinatorial Optimization - 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 - April 1, 2016, Proceedings. Lecture Notes in Computer Science 9595, Springer 2016, ISBN 978-3-319-30697-1 - Baris Keçeci, Fulya Altiparmak, Imdat Kara:
A Hybrid Constructive Mat-heuristic Algorithm for the Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery. 1-17 - Ruby L. V. Moritz, Enrico Reich, Matthias Bernt, Martin Middendorf:
A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations. 18-33 - Nuno Lourenço, Francisco Baptista Pereira, Ernesto Costa:
An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem. 34-45 - Christian Blum, Maria J. Blesa:
Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem. 46-57 - Gabriela Ochoa, Nadarajen Veerapen:
Deconstructing the Big Valley Search Space Hypothesis. 58-73 - Sebastian Herrmann:
Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks. 74-87 - Francisco Chicano, L. Darrell Whitley, Renato Tinós:
Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization. 88-103 - Yujie Chen, Philip Mourdjis, Fiona A. C. Polack, Peter I. Cowling, Stephen Remde:
Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems. 104-120 - Stjepan Picek, Carlos A. Coello Coello, Domagoj Jakobovic, Nele Mentens:
Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance. 121-137 - Anton V. Eremeev, Julia V. Kovalenko:
Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems. 138-153 - Brian W. Goldman, William F. Punch:
Hyperplane Elimination for Quickly Enumerating Local Optima. 154-169 - Fawaz Alanazi, Per Kristian Lehre:
Limits to Learning in Reinforcement Learning Hyper-heuristics. 170-185 - Bradley Hardy, Rhyd Lewis, Jonathan M. Thompson:
Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs. 186-201 - Alexandre Sawczuk da Silva, Yi Mei, Hui Ma, Mengjie Zhang:
Particle Swarm Optimisation with Sequence-Like Indirect Representation for Web Service Composition. 202-218 - Boxiong Tan, Yi Mei, Hui Ma, Mengjie Zhang:
Particle Swarm Optimization for Multi-Objective Web Service Location Allocation. 219-234 - Krzysztof Michalak:
Sim-EDA: A Multipopulation Estimation of Distribution Algorithm Based on Problem Similarity. 235-250 - Danny Munera, Daniel Diaz, Salvador Abreu:
Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization. 251-266
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 2025-11-20 00:11 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:
