On the path avoiding forbidden pairs polytope

DOI10.1016/j.endm.2015.07.057zbMath1347.05100OpenAlexW2222690626MaRDI QIDQ324839

Marco Blanco, Ralf Borndörfer, Nam Dũng Hoàng, Michael Brückner, Thomas Schlechte

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.057

zbMATH Keywords

shortest path problemforbidden pairspath polytope

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Shortest paths with exclusive-disjunction arc pairs conflicts ⋮ Almost disjoint paths and separating by forbidden pairs

Cites Work

• Unnamed Item
• Combinatorial optimization with one quadratic term: spanning trees and forests
• On the complexity of paths avoiding forbidden pairs
• Facets of the \((s,t)-p\)-path polytope
• Complexity of the path avoiding forbidden pairs problem revisited
• The Checkpoint Problem

This page was built for publication: On the path avoiding forbidden pairs polytope