Pages that link to "Item:Q1433652"

The following pages link to On the directed hop-constrained shortest path problem (Q1433652):

Displaying 15 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)
• Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
• On cardinality constrained cycle and path polytopes (Q964176) (← links)
• Facets of the \((s,t)-p\)-path polytope (Q967368) (← links)
• Container shipping service selection and cargo routing with transshipment limits (Q1694945) (← links)
• Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
• Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
• Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← 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)
• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
• Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)