LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: LS(graph): a constraint-based local search for constraint optimization on trees and paths |
scientific article; zbMATH DE number 6389801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LS(graph): a constraint-based local search for constraint optimization on trees and paths |
scientific article; zbMATH DE number 6389801 |
Statements
LS(graph): a constraint-based local search for constraint optimization on trees and paths (English)
0 references
22 January 2015
0 references
combinatorial optimization
0 references
constraint-based local search
0 references
graphs
0 references
constrained optimum trees
0 references
constrained optimum paths
0 references
quorumcast routing
0 references
edge-disjoint paths
0 references
routing and wavelength assignment with delay constraints
0 references
0 references
0 references
0 references
0.8940531611442566
0 references
0.7453528046607971
0 references
0.7416014075279236
0 references
0.7209295034408569
0 references
