Exact approaches for the orderly colored longest path problem: performance comparison (Q1628069)
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: Exact approaches for the orderly colored longest path problem: performance comparison |
scientific article; zbMATH DE number 6988110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact approaches for the orderly colored longest path problem: performance comparison |
scientific article; zbMATH DE number 6988110 |
Statements
Exact approaches for the orderly colored longest path problem: performance comparison (English)
0 references
3 December 2018
0 references
edge colored graphs
0 references
longest path
0 references
integer programming
0 references
0 references
0.8289179801940918
0 references
0.751173734664917
0 references
0.7230465412139893
0 references
0.7169250845909119
0 references
0.7103264331817627
0 references
