Pages that link to "Item:Q1179743"
From MaRDI portal
The following pages link to Dynamic programming based heuristics for the topological design of local access networks (Q1179743):
Displaying 14 items.
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
- Solving a continuous local access network design problem with a stabilized central column generation approach (Q635164) (← links)
- Heuristics for multi-period capacity expansion in local telecommunications networks (Q835760) (← links)
- Optimization of a topologically tree-based local area network (Q1117827) (← links)
- Least-cost network topology design for a new service: An application of tabu search (Q1179745) (← links)
- A knowledge-based approach to the local area network design problem (Q1330416) (← links)
- Heuristic procedure neural networks for the CMST problem (Q1579025) (← links)
- A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
- The algorithmic structure of a decision support system for a design of a district heating network (Q1825117) (← links)
- The capacitated minimum spanning tree problem: On improved multistar constraints (Q1887863) (← links)
- A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem (Q2147081) (← links)
- A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343) (← links)
- Multi-period capacity expansion for a local access telecommunications network (Q2488926) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
