default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvoCOP 2011: Torino, Italy
- Peter Merz, Jin-Kao Hao:
Evolutionary Computation in Combinatorial Optimization - 11th European Conference, EvoCOP 2011, Torino, Italy, April 27-29, 2011. Proceedings. Lecture Notes in Computer Science 6622, Springer 2011, ISBN 978-3-642-20363-3 - Sadaf Naseem Jat, Shengxiang Yang:
A Guided Search Non-dominated Sorting Genetic Algorithm for the Multi-Objective University Course Timetabling Problem. 1-13 - Veronique Sels, Mario Vanhoucke
:
A Hybrid Dual-Population Genetic Algorithm for the Single Machine Maximum Lateness Problem. 14-25 - Matthew J. Craven, Henri C. Jimbo:
A Kolmogorov-Type Stability Measure for Evolutionary Algorithms. 26-37 - Federico Della Croce, Andrea Grosso, Fabio Salassa:
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem. 38-47 - Arnaud Liefooghe, Luís Paquete, Marco Simões, José Rui Figueira:
Connectedness and Local Search for Bicriteria Knapsack Problems. 48-59 - Max Hinne, Elena Marchiori:
Cutting Graphs Using Competing Ant Colonies and an Edge Clustering Heuristic. 60-71 - Yang Wang, Zhipeng Lü, Fred W. Glover, Jin-Kao Hao:
Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming. 72-83 - Wesam Herbawi, Michael Weber:
Evolutionary Multiobjective Route Planning in Dynamic Multi-hop Ridesharing. 84-95 - Yves Caniou, Philippe Codognet, Daniel Diaz, Salvador Abreu:
Experiments in Parallel Constraint-Based Local Search. 96-107 - Guanzhou Lu, Jinlong Li, Xin Yao:
Fitness-Probability Cloud and a Measure of Problem Hardness for Evolutionary Algorithms. 108-117 - He Jiang, Shuyan Zhang, Jifeng Xuan, Youxi Wu:
Frequency Distribution Based Hyper-Heuristic for the Bin-Packing Problem. 118-129 - Giacomo di Tollo, Frédéric Lardeux, Jorge Maturana, Frédéric Saubion:
From Adaptive to More Dynamic Control in Evolutionary Algorithms. 130-141 - Alberto Moraglio, Ahmed Kattan:
Geometric Generalisation of Surrogate Model Based Optimisation to Combinatorial Spaces. 142-154 - Thé Van Luong, Nouredine Melab, El-Ghazali Talbi:
GPU-Based Approaches for Multiobjective Local Search Algorithms. A Case Study: The Flowshop Scheduling Problem. 155-166 - Frédéric Gardi, Karim Nouioua:
Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application. 167-178 - Teodor Gabriel Crainic, Simona Mancini, Guido Perboli, Roberto Tadei:
Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem. 179-190 - Marie-Eléonore Marmion, Clarisse Dhaenens, Laetitia Jourdan, Arnaud Liefooghe, Sébastien Vérel:
NILS: A Neutrality-Based Iterated Local Search and Its Application to Flowshop Scheduling. 191-202 - Gianpiero Francesca, Paola Pellegrini, Thomas Stützle, Mauro Birattari:
Off-line and On-line Tuning: A Study on Operator Selection for a Memetic Algorithm Applied to the QAP. 203-214 - Anton V. Eremeev:
On Complexity of the Optimal Recombination for the Travelling Salesman Problem. 215-225 - Sébastien Vérel, Arnaud Liefooghe, Laetitia Jourdan, Clarisse Dhaenens:
Pareto Local Optima of Multiobjective NK-Landscapes with Correlated Objectives. 226-237 - Wei Cheng, Bernd Scheuermann, Martin Middendorf:
Quick-ACO: Accelerating Ant Decisions and Pheromone Updates in ACO. 238-249 - María Soto, André Rossi, Marc Sevaux:
Two Iterative Metaheuristic Approaches to Dynamic Memory Allocation for Embedded Systems. 250-261
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-02-15 00:23 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:
