Valid inequalities for the \(k\)-color shortest path problem

DOI10.1016/j.ejor.2023.12.014MaRDI QIDQ6554645

Emanuel Elias Silva Castelo, Rafael Castro de Andrade, Rommel Dias Saraiva

Publication date: 13 June 2024

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationvalid inequalities\(k\)-color shortest path problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
• Hamiltonian circuits determining the order of chromosomes
• The minimum labeling spanning trees
• DNA physical mapping and alternating Eulerian cycles in 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
• A Colored Path Problem and Its Applications
• An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks

This page was built for publication: Valid inequalities for the \(k\)-color shortest path problem