Pages that link to "Item:Q1698283"

The following pages link to Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283):

Displaying 8 items.

• 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)
• The hub location problem with market selection (Q2027000) (← links)
• An efficient heuristic for a hub location routing problem (Q2070128) (← links)
• A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war (Q2149602) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720) (← links)