Pages that link to "Item:Q803033"

The following pages link to Heuristics for the p-hub location problem (Q803033):

Displaying 36 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)
• Allocation strategies in hub networks (Q418055) (← links)
• Graph clustering (Q458448) (← links)
• Hub location-allocation in intermodal logistic networks (Q531438) (← links)
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP (Q689251) (← links)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• Solving the uncapacitated hub location problem using genetic algorithms (Q707014) (← 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)
• The tree of hubs location problem (Q1039782) (← links)
• A linear program for the two-hub location problem (Q1278146) (← links)
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346) (← links)
• Efficient solution procedure and reduced size formulations for \(p\)-hub location problems (Q1296008) (← links)
• Location of hubs in a competitive environment (Q1296365) (← links)
• A hybrid genetic/optimization algorithm for a task allocation problem (Q1297698) (← links)
• Integer programming formulations of discrete hub location problems (Q1317166) (← links)
• On tabu search for the location of interacting hub facilities (Q1328642) (← links)
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem (Q1342649) (← links)
• Optimal use of hub facilities: A two-hub model with fixed arc costs (Q1367882) (← links)
• The hub location and routing problem (Q1388939) (← links)
• The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← 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)
• Reliable single allocation hub location problem under hub breakdowns (Q1652650) (← links)
• An improved algorithm for fixed-hub single allocation problems (Q1697895) (← links)
• Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
• Hub-and-spoke network design with congestion (Q1764770) (← links)
• A polynomial algorithm for balanced clustering via graph partitioning (Q2029025) (← 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)