Pages that link to "Item:Q2384910"
From MaRDI portal
The following pages link to Modeling and solving the rooted distance-constrained minimum spanning tree problem (Q2384910):
Displaying 14 items.
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- Multiperiod location-routing with decoupled time scales (Q439365) (← links)
- The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
- An exact approach for the minimum-cost bounded-error calibration tree problem (Q2178300) (← links)
- A voltage drop limited decentralized electric power distribution network (Q2185525) (← links)
- Reload cost trees and network design (Q2913949) (← 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)
- On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)
