Exact approaches for the orderly colored longest path problem: performance comparison

DOI10.1016/j.cor.2018.08.005zbMath1458.90605OpenAlexW2887907926WikidataQ129422037 ScholiaQ129422037MaRDI QIDQ1628069

Raffaele Cerulli, Francesco Carrabs, Gaurav Singh, Giovanni Felici

Publication date: 3 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.08.005

zbMATH Keywords

integer programminglongest pathedge colored graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Paths and cycles (05C38)

Related Items (5)

Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles ⋮ A generalization of properly colored paths and cycles in edge-colored graphs ⋮ A dynamic programming algorithm for solving the \(k\)-color shortest path problem ⋮ An exact reduction technique for the k-colour shortest path problem ⋮ \(H\)-cycles in \(H\)-colored multigraphs

Cites Work

• Unnamed Item
• Properly colored paths and cycles
• Variable neighborhood search for the heaviest \(k\)-subgraph
• Hamiltonian circuits determining the order of chromosomes
• On the complexity of rainbow spanning forest problem
• The rainbow spanning forest problem
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Optimal pathway reconstruction on 3D NMR maps
• Cycles and paths in edge‐colored graphs with given degrees
• Odd Minimum Cut-Sets and b-Matchings
• An Edge-Colored Version of Dirac's Theorem
• The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
• A Dirac Type Condition for Properly Coloured Paths and Cycles

This page was built for publication: Exact approaches for the orderly colored longest path problem: performance comparison