Pages that link to "Item:Q1807932"

The following pages link to Notes on polyhedra associated with hop-constrained paths (Q1807932):

Displaying 10 items.

• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
• The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
• A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← links)
• A note on hop-constrained walk polytopes. (Q703241) (← links)
• On the directed hop-constrained shortest path problem (Q1433652) (← links)
• A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
• On the \(k\) edge-disjoint 2-hop-constrained paths polytope (Q2480058) (← links)
• On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow (Q5119381) (← links)
• Hop‐level flow formulation for the survivable network design with hop constraints problem (Q5326786) (← links)
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)