Pages that link to "Item:Q853560"
From MaRDI portal
The following pages link to Polyhedral analysis for concentrator location problems (Q853560):
Displaying 11 items.
- The location-dispatching problem: polyhedral results and content delivery network design (Q496706) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Application of the facility location problem to the problem of locating concentrators on an FAA microwave system (Q1339146) (← links)
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
- Concentrator location in telecommunications networks. (Q1762564) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- A new extended formulation with valid inequalities for the capacitated concentrator location problem (Q2029271) (← links)
- On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
- Solving convex location problems with gauges in polynomial time (Q2708113) (← links)
- The location-dispatching problem: polyhedral results and content delivery network design (Q2861504) (← links)
- (Q4459964) (← links)