Pages that link to "Item:Q689251"

The following pages link to Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP (Q689251):

Displaying 44 items.

• Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks (Q336554) (← links)
• A genetic algorithm for the uncapacitated single allocation planar hub location problem (Q337658) (← 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 clustering approach to the planar hub location problem (Q689257) (← links)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521) (← 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 general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
• A GRASP for a difficult single machine scheduling problem (Q1184452) (← links)
• A linear program for the two-hub location problem (Q1278146) (← links)
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346) (← links)
• An efficient tabu search procedure for the \(p\)-median problem (Q1278496) (← 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)
• Integer programming formulations of discrete hub location problems (Q1317166) (← links)
• On tabu search for the location of interacting hub facilities (Q1328642) (← links)
• The hub location and routing problem (Q1388939) (← links)
• Solving large single allocation \(p\)-hub problems with two or three hubs (Q1595449) (← 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 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)
• Hub-and-spoke network design with congestion (Q1764770) (← links)
• Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm (Q1792363) (← links)
• Greedy randomized adaptive search procedures (Q1804580) (← links)
• Tabu search for graph partitioning (Q1919841) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← 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)
• Bounds for the single source modular capacitated plant location problem (Q2489136) (← links)
• A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties (Q2563872) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← 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)
• HubLocator: An exact solution method for the multiple allocation hub location problem (Q5959392) (← links)
• A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands (Q6087494) (← links)
• A parallel adaptive memory algorithm for the capacitated modular hub location problem (Q6164373) (← links)
• Assessing the benefits of storage and transshipments yards in timber supply chains by a column generation + GRASP approach (Q6596964) (← links)