A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5023550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem |
scientific article; zbMATH DE number 5023550 |
Statements
A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (English)
0 references
16 May 2006
0 references
Combinatorial optimization problem
0 references
Data structure
0 references
Diversification strategy
0 references
Facility layout
0 references
Graph theory
0 references
Construction heuristics
0 references
Meta-heuristics
0 references
Tabu search
0 references
Weighted maximal planar graph
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.86037636
0 references
0.85908675
0 references
0.8581569
0 references
0.8523597
0 references
0.8386924
0 references
0.8379936
0 references
0.83743805
0 references
0.83579135
0 references
0.83569074
0 references
