Pages that link to "Item:Q4987784"

The following pages link to An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem (Q4987784):

Displaying 9 items.

• A genetic algorithm for the uncapacitated single allocation planar hub location problem (Q337658) (← links)
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem (Q879279) (← links)
• Path relinking approach for multiple allocation hub maximal covering problem (Q971739) (← links)
• A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131) (← links)
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q1687628) (← links)
• A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming (Q1797769) (← links)
• Multi-period hub set covering problems with flexible radius: a modified genetic solution (Q2289304) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• An efficient model for the multiple allocation hub maximal covering problem (Q6078427) (← links)