Introduction to routing problems with mandatory transitions

DOI10.1007/978-3-031-23101-8_17MaRDI QIDQ6169531zbMATH OpenOpenAlexFDO

Authors Christian Laforest, Timothée Martinod

Publication date 14 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-23101-8_17

zbMATH Keywords

complexitydirected graphobligationrouting problemshortest path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On minimum connecting transition sets in graphs
• An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions
• Finding paths in grids with forbidden transitions
• scientific article; zbMATH DE number 841575
• The constrained shortest path tour problem

Cites work

• An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions
• Domination problems with no conflicts
• Finding paths in grids with forbidden transitions
• Graph problems with obligations
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the complexity of independent dominating set with obligations in graphs
• Some Hamiltonian properties of one-conflict graphs
• The traveling salesman problem: An overview of exact and approximate algorithms
• Total domination, connected vertex cover and Steiner tree with conflicts

This page was built for publication: Introduction to routing problems with mandatory transitions

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