Exact approaches for the orderly colored longest path problem: Performance comparison
- 7 August 2018
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 101, 275-284
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The Orderly Colored Longest Path Problem – a survey of applications and new algorithmsRAIRO - Operations Research, 2013
- Properly colored paths and cyclesDiscrete Applied Mathematics, 2011
- Variable neighborhood search for the heaviest -subgraphComputers & Operations Research, 2009
- Cycles and paths in edge‐colored graphs with given degreesJournal of Graph Theory, 2009
- RNA tertiary structure determination: NOE pathways construction by tabu searchBioinformatics, 2005
- An Algorithm for an Automatic NOE Pathways Analysis of 2D NMR Spectra of RNA DuplexesJournal of Computational Biology, 2004
- DNA physical mapping and alternating Eulerian cycles in colored graphsAlgorithmica, 1995
- Hamiltonian circuits determining the order of chromosomesDiscrete Applied Mathematics, 1994
- On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphsLecture Notes in Computer Science, 1991
- Odd Minimum Cut-Sets and b-MatchingsMathematics of Operations Research, 1982