Pages that link to "Item:Q5892561"
From MaRDI portal
The following pages link to Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561):
Displayed 14 items.
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← 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)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
- A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (Q2270325) (← links)
- Characterizing acyclic graphs by labeling edges (Q2448884) (← links)
- Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519) (← links)
- A New Formulation for Spanning Trees (Q2840708) (← links)
- A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777) (← links)
- Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← 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 (Q5891541) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)