Valid inequalities for the k-color shortest path problem

DOI10.1016/J.EJOR.2023.12.014MaRDI QIDQ6554645zbMATH OpenFDO

Authors Rafael Castro de Andrade, Emanuel Elias Silva Castelo, 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

• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• A Colored Path Problem and Its Applications
• A dynamic programming algorithm for solving the k-color shortest path problem
• An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
• An exact reduction technique for the k-colour shortest path problem
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Hamiltonian circuits determining the order of chromosomes
• Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
• The minimum labeling spanning trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554645)