You have Guest access.
Log In
Vittorio Maniezzo, Roberto Battiti and Jean-Paul Watson
Front matter
1-11
Nested Partitioning for the Minimum Energy Broadcast Problem
12-24
An Adaptive Memory-Based Approach Based on Partial Enumeration
25-40
Learning While Optimizing an Unknown Fitness Surface
41-55
On Effectively Finding Maximal Quasi-cliques in Graphs
56-68
Improving the Exploration Strategy in Bandit Algorithms
69-80
Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem
81-94
Image Thresholding Using TRIBES, a Parameter-Free Particle Swarm Optimization Algorithm
95-109
Explicit and Emergent Cooperation Schemes for Search Algorithms
110-124
Multiobjective Landscape Analysis and the Generalized Assignment Problem
125-137
Limited-Memory Techniques for Sensor Placement in Water Distribution Networks
138-152
A Hybrid Clustering Algorithm Based on Honey Bees Mating Optimization and Greedy Randomized Adaptive Search Procedure
153-166
Ant Colony Optimization and the Minimum Spanning Tree Problem
167-176
A Vector Assignment Approach for the Graph Coloring Problem
177-191
Rule Extraction from Neural Networks Via Ant Colony Algorithm for Data Mining Applications
192-205
Tuning Local Search by Average-Reward Reinforcement Learning
206-219
Evolution of Fitness Functions to Improve Heuristic Performance
220-233
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
234-242
Hybrid Heuristics for Multi-mode Resource-Constrained Project Scheduling
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info