On the Cycle Polytope of a Directed Graph and Its Relaxations.

Egon Balas Rüdiger Stephan

Published in: OR (2006)

Keyphrases

directed graph
semidefinite
random walk
lower bound
linear programming
directed acyclic graph
graph structure
maximum flow
undirected graph
np hard
directed edges
search algorithm
knapsack problem
shortest path problem
upper bound
strongly connected
disjoint paths