Pages that link to "Item:Q976311"

The following pages link to A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311):

Displaying 45 items.

• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• Nested general variable neighborhood search for the periodic maintenance problem (Q322899) (← links)
• A compact linearisation of Euclidean single allocation hub location problems (Q325380) (← links)
• Lower bounding procedures for the single allocation hub location problem (Q325391) (← links)
• Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks (Q336554) (← links)
• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
• A genetic algorithm for the uncapacitated single allocation planar hub location problem (Q337658) (← links)
• Variable neighborhood search for location routing (Q339539) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem (Q526415) (← links)
• General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421) (← links)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution (Q727374) (← links)
• Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion (Q1639271) (← links)
• Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
• Reliable single allocation hub location problem under hub breakdowns (Q1652650) (← links)
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• HUBBI: iterative network design for incomplete hub location problems (Q1725629) (← links)
• A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)
• Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
• Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
• Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
• Less is more: general variable neighborhood search for the capacitated modular hub location problem (Q2002852) (← links)
• Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
• A review of transport market modeling using game-theoretic principles (Q2030641) (← links)
• An efficient heuristic for a hub location routing problem (Q2070128) (← links)
• A non-triangular hub location problem (Q2191284) (← links)
• Spatial analysis of single allocation hub location problems (Q2358050) (← links)
• The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)
• 0-1 quadratic knapsack problem solved with VNS algorithm (Q2631284) (← links)
• In memory of Professor Nenad Mladenović (1951--2022) (Q2677361) (← links)
• In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey (Q2691459) (← links)
• Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region (Q5085994) (← links)
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem (Q5278229) (← links)
• Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint (Q6043112) (← links)
• A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale (Q6047905) (← links)
• The uncapacitated <i>r</i>‐allocation <i>p</i>‐hub center problem (Q6070875) (← links)
• Machine learning augmented approaches for hub location problems (Q6109558) (← links)