The following pages link to (Q5294063):
Displaying 25 items.
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← links)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← links)
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
- Container shipping service selection and cargo routing with transshipment limits (Q1694945) (← links)
- A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
- Modeling and solving the rooted distance-constrained minimum spanning tree problem (Q2384910) (← links)
- An Exact Algorithm for the Steiner Tree Problem with Delays (Q2883568) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (Q6066244) (← links)
- Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks (Q6160230) (← links)
