Subgraph extraction and meteheuristics for the maximum clique problem

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of heuristics
1. Verfasser: Dang, Duc-cuong (VerfasserIn)
Weitere Verfasser: Moukrim, Aziz (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2012
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand 2012 Rainwater, Chase
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data 2012 Kasperski, Adam
Strategies for designing energy-efficient clusters-based WSN topologies 2012
A mutation operator based on a Pareto ranking for multi-objective evolutionary algorithms 2012 Mateo, P. M.
A tabu search heuristic procedure for the capacitated facility location problem 2012 Sun, Minghe
GRASP and path relinking hybridizations for the point matching-based image registration problem 2012
One hyper-heuristic approach to two timetabling problems in health care 2012
A review on probabilistic graphical models in evolutionary computation 2012
The balanced academic curriculum problem revisited 2012
A mathematical model and a metaheuristic approach for a memory allocation problem 2012 Soto, María
A hybridized tabu search approach for the minimum weight vertex cover problem 2012 Voß, Stefan
Kernel search for the capacitated facility location problem 2012 Guastaroba, G.
Bee colony optimization for scheduling independent tasks to identical processors 2012
A novel ant colony optimization approach for on-line scheduling and due date determination 2012 Liang, Yun-chia
A Forex trading system based on a genetic algorithm 2012 Mendes, Luís
Cell-transmission-based evacuation planning with rescue teams 2012 Kimms, Alf
Experimental analysis of heuristics for the bottleneck traveling salesman problem 2012 LaRusic, John
Simple heuristics for the assembly line worker assignment and balancing problem 2012
Path-relinking intensification methods for stochastic local search algorithms 2012 Ribeiro, Celso C.
An improved heuristic for the far from most strings problem 2012 Mousavi, Sayyed Rasoul
Alle Artikel auflisten