On the path avoiding forbidden pairs polytope
From MaRDI portal
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
Cites work
- Combinatorial optimization with one quadratic term: spanning trees and forests
- Complexity of the path avoiding forbidden pairs problem revisited
- Facets of the (s,t)-p-path polytope
- scientific article; zbMATH DE number 1445327 (Why is no real title available?)
- On the complexity of paths avoiding forbidden pairs
- The checkpoint problem
Cited in
(6)- Complexity of the path avoiding forbidden pairs problem revisited
- 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
- An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints
- On the complexity of paths avoiding forbidden pairs
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)
