Exact approaches for the orderly colored longest path problem: performance comparison
type: Item
instance of: scholarly article
title: Exact approaches for the orderly colored longest path problem: performance comparison
zbMATH Open document ID: 1458.90605
author: Francesco Carrabs
author: Raffaele Cerulli
author: Giovanni Felici
author: Gaurav Singh
published in: Computers \& Operations Research
publication date: 2018-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6988110
zbMATH Keywords: edge colored graphs
zbMATH Keywords: longest path
zbMATH Keywords: integer programming
MaRDI profile type: Publication
full work available at URL: j.cor.2018.08.005
OpenAlex ID: W2887907926
cites work: Cycles and paths in edge‐colored graphs with given degrees
cites work: Variable neighborhood search for the heaviest \(k\)-subgraph
cites work: On the complexity of rainbow spanning forest problem
cites work: The rainbow spanning forest problem
cites work: Hamiltonian circuits determining the order of chromosomes
cites work: Properly colored paths and cycles
cites work: Q4198056
cites work: A Dirac Type Condition for Properly Coloured Paths and Cycles
cites work: An Edge-Colored Version of Dirac's Theorem
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: DNA physical mapping and alternating Eulerian cycles in colored graphs
cites work: The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
cites work: Optimal pathway reconstruction on 3D NMR maps
Wikidata QID: Q129422037
DOI: 10.1016/J.COR.2018.08.005
description: scientific article; zbMATH DE number 6988110