Pages that link to "Item:Q1628069"

The following pages link to Exact approaches for the orderly colored longest path problem: performance comparison (Q1628069):

Displaying 8 items.

• A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
• A dynamic programming algorithm for solving the \(k\)-color shortest path problem (Q2047192) (← links)
• An exact reduction technique for the k-colour shortest path problem (Q2108122) (← links)
• \(H\)-cycles in \(H\)-colored multigraphs (Q2117527) (← links)
• Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles (Q2656965) (← links)
• New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
• A generalization of properly colored paths and cycles in edge-colored graphs (Q2682924) (← links)
• The Orderly Colored Longest Path Problem – a survey of applications and new algorithms (Q5410241) (← links)