Pages that link to "Item:Q3703812"
From MaRDI portal
The following pages link to Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds (Q3703812):
Displayed 23 items.
- A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
- Optimization of resource location in hierarchical computer networks (Q583895) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
- Models for planning capacity expansion in local access telecommunication networks (Q806810) (← links)
- A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- Strategic design of distribution systems with economies of scale in transportation (Q867550) (← links)
- Efficient algorithms for the capacitated concentrator location problem (Q1088878) (← links)
- Topological design of telecommunication networks --- local access design methods (Q1179728) (← links)
- The \(K\)-coverage concentrator location problem (Q1193145) (← links)
- Locating concentrators in centralized computer networks (Q1197789) (← links)
- Optimal design of a distributed network with a two-level hierarchical structure (Q1203810) (← links)
- On a cost allocation problem arising from a capacitated concentrator covering problem (Q1316101) (← links)
- Hybrid fiber co-axial CATV network design with variable capacity optical network units (Q1577122) (← links)
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints (Q2367382) (← links)
- Topological design of a two-level network with ring-star configuration (Q2367422) (← links)
- Lower and upper bounds for a two-level hierarchical location problem in computer networks (Q2462545) (← links)
- Star \(p\)-hub median problem with modular arc capacities (Q2475857) (← links)
- COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
- Combined capacity planning and concentrator location in computer communications networks (Q3496146) (← links)
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site (Q4405938) (← links)