Pages that link to "Item:Q5938742"
From MaRDI portal
The following pages link to Tabu search for a network loading problem with multiple facilities (Q5938742):
Displaying 18 items.
- A hybrid data mining GRASP with path-relinking (Q336726) (← links)
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Applying tabu search to spare capacity planning for network restoration (Q1302556) (← links)
- Iterative improvement methods for a multiperiod network design problem (Q1303714) (← links)
- A tabu search algorithm for access network design (Q1599313) (← links)
- A tabu search algorithm for the optimisation of telecommunication networks (Q1609900) (← links)
- Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
- A tabu search algorithm for the network pricing problem (Q1761203) (← links)
- A tabu search algorithm for the routing and capacity assignment problem in computer networks (Q1781553) (← links)
- Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
- A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343) (← links)
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem (Q2271122) (← links)
- Exact approaches to the single-source network loading problem (Q2892148) (← links)
- Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search (Q3116642) (← links)
- Wide area telecommunication network design: application to the Alberta SuperNet (Q3394015) (← links)
- Bandwidth Packing: A Tabu Search Approach (Q4202466) (← links)
- Metaheuristics: A Canadian Perspective (Q6102854) (← links)
