Pages that link to "Item:Q1385332"

The following pages link to Solution approaches to hub location problems (Q1385332):

Displaying 26 items.

• Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks (Q336554) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Hub location-allocation in intermodal logistic networks (Q531438) (← links)
• New simple and efficient heuristics for the uncapacitated single allocation hub location problem (Q833533) (← links)
• A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil (Q863989) (← links)
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem (Q879279) (← links)
• A hybrid heuristic for the uncapacitated hub location problem (Q1609911) (← links)
• Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion (Q1639271) (← links)
• A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem (Q1651637) (← links)
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← links)
• Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
• Integer linear programming models for grid-based light post location problem (Q1926907) (← links)
• Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
• Exclusive bus Lane network design: a perspective from intersection operational dynamics (Q2005899) (← links)
• Competitive multiple allocation hub location problem considering primary and backup routes (Q2140777) (← links)
• A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations (Q2275582) (← links)
• A combined average-case and worst-case analysis for an integrated hub location and revenue management problem (Q2296583) (← links)
• Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation (Q2479841) (← links)
• Network hub location problems: The state of the art (Q2482813) (← links)
• On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)
• An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem (Q4987784) (← links)
• HubLocator: An exact solution method for the multiple allocation hub location problem (Q5959392) (← links)
• On hub location problems in geographically flexible networks (Q6071054) (← links)
• Multiple allocation hub location with service level constraints for two shipment classes (Q6112611) (← links)
• The p-hub centre routing problem with emissions budget: formulation and solution procedure (Q6164586) (← links)
• An $$\alpha $$-risk appetite cost minimizing model for multi-commodity capacitated p-hub median problem with time windows and uncertain flows (Q6491665) (← links)