default search action
EvoCOP 2013: Vienna, Austria
- Martin Middendorf, Christian Blum:
Evolutionary Computation in Combinatorial Optimization - 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013. Proceedings. Lecture Notes in Computer Science 7832, Springer 2013, ISBN 978-3-642-37197-4 - Ahmed Kheiri, Ender Özcan:
A Hyper-heuristic with a Round Robin Neighbourhood Selection. 1-12 - Álvaro Rubio-Largo, Miguel A. Vega-Rodríguez:
A Multiobjective Approach Based on the Law of Gravity and Mass Interactions for Optimizing Networks. 13-24 - Liam Cervante, Bing Xue, Lin Shang, Mengjie Zhang:
A Multi-objective Feature Selection Approach Based on Binary PSO and Rough Set Theory. 25-36 - Reza Abbasian, Malek Mouhoub:
A New Crossover for Solving Constraint Satisfaction Problems. 37-48 - Wei Xiao, Wenqing Chu, Zhipeng Lü, Tao Ye, Guang Liu, Shanshan Cui:
A Population-Based Strategic Oscillation Algorithm for Linear Ordering Problem with Cumulative Costs. 49-60 - Una Benlic, Jin-Kao Hao:
A Study of Adaptive Perturbation Strategy for Iterated Local Search. 61-72 - Mihai Suciu, Denis Pallez, Marcel Cremene, Dumitru Dumitrescu:
Adaptive MOEA/D for QoS-Based Web Service Composition. 73-84 - Leonardo C. T. Bezerra, Manuel López-Ibáñez, Thomas Stützle:
An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem. 85-96 - Broos Maenhout, Mario Vanhoucke:
An Artificial Immune System Based Approach for Solving the Nurse Re-rostering Problem. 97-108 - Erik Pitzer, Andreas Beham, Michael Affenzeller:
Automatic Algorithm Selection for the Quadratic Assignment Problem Using Fitness Landscape Analysis. 109-120 - Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl:
Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach. 121-132 - Yannis Marinakis, Magdalene Marinaki:
Combinatorial Neighborhood Topology Particle Swarm Optimization Algorithm for the Vehicle Routing Problem. 133-144 - Chuang Liu, Min Han:
Dynamic Evolutionary Membrane Algorithm in Dynamic Environments. 145-156 - Alejandro Arbelaez, Philippe Codognet:
From Sequential to Parallel Local Search for SAT. 157-168 - Shahriar Asta, Ender Özcan, Andrew J. Parkes, A. Sima Etaner-Uyar:
Generalizing Hyper-heuristics via Apprenticeship Learning. 169-178 - Yuichi Nagata, Isao Ono:
High-Order Sequence Entropies for Measuring Population Diversity in the Traveling Salesman Problem. 179-190 - Shalom Eliahou, Cyril Fonlupt, Jean Fromentin, Virginie Marion-Poty, Denis Robilliard, Fabien Teytaud:
Investigating Monte-Carlo Methods on the Weak Schur Problem. 191-201 - Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant:
Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches. 202-213 - Mario Ventresca, Beatrice M. Ombuki-Berman, Andrew Runka:
Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape Measures. 214-225 - Marc Reimann, José Eugênio Leal:
Single Line Train Scheduling with ACO. 226-237 - David Chalupa:
Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search. 238-249 - Johannes Inführ, Günther R. Raidl:
Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent. 250-261 - Rommel Dias Saraiva, Napoleão Nepomuceno, Plácido Rogério Pinheiro:
The Generate-and-Solve Framework Revisited: Generating by Simulated Annealing. 262-273
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.