Pages that link to "Item:Q1179743"

The following pages link to Dynamic programming based heuristics for the topological design of local access networks (Q1179743):

Displaying 8 items.

• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
• Heuristics for multi-period capacity expansion in local telecommunications networks (Q835760) (← 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 capacitated minimum spanning tree problem: On improved multistar constraints (Q1887863) (← links)
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem (Q2147081) (← links)
• Multi-period capacity expansion for a local access telecommunications network (Q2488926) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)