The following pages link to Optimal capacitated ring trees (Q286687):
Displaying 15 items.
- Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
- The ring tree facility location problem (Q324831) (← links)
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- Efficient algorithms for wavelength assignment on trees of rings (Q1028409) (← links)
- Exact algorithms for bi-objective ring tree problems with reliability measures (Q1652601) (← links)
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- A branch-and-price algorithm for the ring-tree facility location problem (Q2132327) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)
- Editorial (Q5965491) (← links)
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
- Leader-follower coherence in noisy ring-trees networks (Q6132343) (← links)
- New path elimination constraints for multi-depot routing problems (Q6496355) (← links)
