Pages that link to "Item:Q1687628"

The following pages link to A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q1687628):

Displaying 9 items.

• General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421) (← links)
• A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131) (← links)
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
• Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion (Q2052283) (← links)
• The min-p robust optimization approach for facility location problem under uncertainty (Q2165274) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem (Q4987784) (← links)
• The uncapacitated <i>r</i>‐allocation <i>p</i>‐hub center problem (Q6070875) (← links)
• An efficient model for the multiple allocation hub maximal covering problem (Q6078427) (← links)