Pages that link to "Item:Q337094"

The following pages link to A branch-and-cut algorithm for the hub location and routing problem (Q337094):

Displaying 35 items.

• Hierarchical survivable network design problems (Q325448) (← links)
• A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
• A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201) (← links)
• A linear program for the two-hub location problem (Q1278146) (← links)
• The hub location and routing problem (Q1388939) (← links)
• Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
• The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach (Q1651527) (← links)
• Routing and scheduling decisions in the hierarchical hub location problem (Q1652350) (← links)
• An endosymbiotic evolutionary algorithm for the hub location-routing problem (Q1665926) (← links)
• A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• HUBBI: iterative network design for incomplete hub location problems (Q1725629) (← links)
• Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations (Q1733092) (← links)
• Branch-and-price-and-cut for a service network design and hub location problem (Q1752143) (← links)
• A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
• A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms (Q1782170) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• An efficient heuristic for a hub location routing problem (Q2070128) (← links)
• Solving partitioning-hub location-routing problem using DCA (Q2358847) (← links)
• A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
• A capacitated hub location problem in freight logistics multimodal networks (Q2629899) (← links)
• Planning and design of intermodal hub networks: a literature review (Q2669565) (← links)
• Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem (Q2672134) (← links)
• A fuzzy correlation based heuristic for dual-mode integrated location routing problem (Q2676327) (← links)
• Hub location problem considering spoke links with incentive-dependent capacities (Q2676359) (← links)
• A generalized model and a heuristic algorithm for the large-scale covering tour problem (Q4553890) (← links)
• A branch-and-cut algorithm for the plant-cycle location problem (Q4661044) (← links)
• Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region (Q5085994) (← links)
• A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)
• Location‐routing problem: a classification of recent research (Q6092538) (← links)
• Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation (Q6106564) (← links)
• Multi-period single-allocation hub location-routing: models and heuristic solutions (Q6113308) (← links)
• Modeling and solving the two-level generalized median tour problem (Q6551171) (← links)