Pages that link to "Item:Q3116642"

The following pages link to Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search (Q3116642):

Displaying 19 items.

• Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
• Heuristic algorithms for the multi-depot ring-star problem (Q1043363) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• Locating median cycles in networks (Q1887911) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
• A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
• Spatial coverage in routing and path planning problems (Q2083923) (← links)
• Algorithms for the design of network topologies with balanced disjoint rings (Q2267818) (← links)
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
• Scatter search for the vehicle routing problem with time windows (Q2570159) (← links)
• A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems (Q2572867) (← links)
• Metaheuristics and cooperative approaches for the bi-objective ring star problem (Q2654392) (← links)
• Continuous maximal covering location problems with interconnected facilities (Q2668753) (← links)
• Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519) (← links)
• Cost-effective designs of fault-tolerant access networks in communication systems (Q3057095) (← links)
• The Ring Star Problem: Polyhedral analysis and exact algorithm (Q4474293) (← links)
• A survivable variant of the ring star problem (Q6196876) (← links)