On the path avoiding forbidden pairs polytope

DOI10.1016/J.ENDM.2015.07.057zbMATH Open1347.05100OpenAlexW2222690626MaRDI QIDQ324839FDOQ324839

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

Publication date: 17 October 2016

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

Recommendations

• On the complexity of paths avoiding forbidden pairs
• On paths avoding forbidden pairs of vertices in a graph
• Complexity of the path avoiding forbidden pairs problem revisited
• Paths on polymatroids
• Pairwise intersections and forbidden configurations
• Pairwise intersections and forbidden configurations
• Maximal nonrevisiting paths in simple polytopes
• On cardinality constrained cycle and path polytopes
• Notes on polyhedra associated with hop-constrained paths
• On vertex-degree restricted paths in polyhedral graphs

zbMATH Keywords

shortest path problemforbidden pairspath polytope

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Complexity of the path avoiding forbidden pairs problem revisited
• The checkpoint problem
• 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

Cited In (5)

• Shortest paths with exclusive-disjunction arc pairs conflicts
• Almost disjoint paths and separating by forbidden pairs
• On paths avoding forbidden pairs of vertices in a graph
• On the complexity of paths avoiding forbidden pairs
• Complexity of the path avoiding forbidden pairs problem revisited

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

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