Pages that link to "Item:Q1328642"

The following pages link to On tabu search for the location of interacting hub facilities (Q1328642):

Displaying 50 items.

• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• An \(M/M/c\) queue model for hub covering location problem (Q409968) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Hub location-allocation in intermodal logistic networks (Q531438) (← links)
• A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem (Q613548) (← links)
• Stochastic air freight hub location and flight routes planning (Q733484) (← links)
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521) (← 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)
• Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
• A linear program for the two-hub location problem (Q1278146) (← links)
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346) (← links)
• Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
• Efficient solution procedure and reduced size formulations for \(p\)-hub location problems (Q1296008) (← links)
• Location of hubs in a competitive environment (Q1296365) (← links)
• The hub location and routing problem (Q1388939) (← links)
• The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
• Digital data networks design using genetic algorithms (Q1590811) (← links)
• Solving large single allocation \(p\)-hub problems with two or three hubs (Q1595449) (← links)
• Network cost minimization using threshold-based discounting (Q1600844) (← 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)
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← links)
• An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
• A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131) (← links)
• Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
• The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems (Q1725627) (← links)
• HUBBI: iterative network design for incomplete hub location problems (Q1725629) (← links)
• Hub-and-spoke network design with congestion (Q1764770) (← links)
• Threshold based discounting networks: the cost allocation provided by the nucleolus (Q1779541) (← links)
• Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm (Q1792363) (← links)
• An efficient heuristic for the expansion problem of cellular wireless networks (Q1885950) (← links)
• Tabu search for graph partitioning (Q1919841) (← links)
• A tabu search algorithm for frequency assignment (Q1919845) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
• Competitive multiple allocation hub location problem considering primary and backup routes (Q2140777) (← links)
• Modeling two-stage UHL problem with uncertain demands (Q2289309) (← links)
• Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm (Q2295062) (← 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)
• Capacitated single allocation hub location problem-A bi-criteria approach (Q2483516) (← links)
• A note on Steiner tree games (Q2892158) (← links)
• On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)
• The single allocation problem in the interacting three-hub network (Q4944738) (← links)
• Hub Location Problems: The Location of Interacting Facilities (Q5506727) (← links)
• Dual-based approach for a hub network design problem under non-restrictive policy (Q5938396) (← links)
• Tabu search for a class of single-machine scheduling problems (Q5945325) (← links)