The following pages link to (Q3147665):
Displaying 15 items.
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- Polyhedral analysis for concentrator location problems (Q853560) (← links)
- A review of hierarchical facility location models (Q868995) (← links)
- Optimal design of hierarchical networks with free main path extremes (Q943800) (← links)
- On split-coloring problems (Q995923) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Multi-level facility location problems (Q1754251) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- Optimizing splitter and fiber location in a multilevel optical FTTH network (Q1926952) (← links)
- The double-assignment plant location problem with co-location (Q2026959) (← links)
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location (Q5131704) (← links)
- Solving the hub location problem in a star–star network (Q5433190) (← links)
- New variants of the simple plant location problem and applications (Q6106762) (← links)
- A survivable variant of the ring star problem (Q6196876) (← links)
