Pages that link to "Item:Q526415"

The following pages link to A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem (Q526415):

Displaying 11 items.

• General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421) (← links)
• A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem (Q1651637) (← links)
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
• Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations (Q1733092) (← links)
• A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)
• A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← links)
• An efficient heuristic for a hub location routing problem (Q2070128) (← links)
• A non-triangular hub location problem (Q2191284) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm (Q4972548) (← links)
• The uncapacitated <i>r</i>‐allocation <i>p</i>‐hub center problem (Q6070875) (← links)