scientific article; zbMATH DE number 776078

MaRDI QIDQ4840098zbMATH OpenFDO

Authors A. B. Gamble, Jin Liu, Collette R. Coullard

Publication date 14 August 1995

zbMATH Keywords

\(k\)-walkdirected graphextended linear programmingprojection method

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A note on hop-constrained walk polytopes.
• Notes on polyhedra associated with hop-constrained paths
• On the k-cut subgraph polytope
• On the Linear Description of the k-cycle Polytope
• On the difficulty of finding walks of length k

Cited in

(5)

• Notes on polyhedra associated with hop-constrained paths
• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
• On the Linear Description of the k-cycle Polytope
• The k edge-disjoint 3-hop-constrained paths polytope
• A note on hop-constrained walk polytopes.

This page was built for publication:

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