Pages that link to "Item:Q1762564"
From MaRDI portal
The following pages link to Concentrator location in telecommunications networks. (Q1762564):
Displaying 14 items.
- Approximation algorithm for optimal location of concentrators and design of capacitated survivable backbone networks (Q622809) (← links)
- Polyhedral analysis for concentrator location problems (Q853560) (← links)
- Advances in location analysis (Q864011) (← links)
- A hierarchical solution approach for a multicommodity distribution problem under a special cost structure (Q1761205) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Concentrator location in telecommunications (Q1885343) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Integer linear programming models for grid-based light post location problem (Q1926907) (← links)
- Modeling the capacitated \(p\)-cable trench problem with facility costs (Q2045638) (← links)
- Solving the hub location problem with modular link capacities (Q2387305) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- Quantum−like nonseparable structures in optical beams (Q5142618) (← links)
- Classical entanglement in polarization metrology (Q5143459) (← links)
- Solving the hub location problem in a star–star network (Q5433190) (← links)