Linear programming based meta-heuristics for the weighted maximal planar graph (Q4656733)
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 2144462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear programming based meta-heuristics for the weighted maximal planar graph |
scientific article; zbMATH DE number 2144462 |
Statements
Linear programming based meta-heuristics for the weighted maximal planar graph (English)
0 references
14 March 2005
0 references
facility layout
0 references
heuristics
0 references
greedy adaptive random search procedure
0 references
integer programming formulation
0 references
maximal planar graph
0 references
models
0 references
meta-heuristics
0 references
0.8124383091926575
0 references
0.796104907989502
0 references
0.7956553101539612
0 references
