Pages that link to "Item:Q1278346"

The following pages link to Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346):

Displaying 50 items.

• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• Multi-product capacitated single-allocation hub location problems: formulations and inequalities (Q301056) (← links)
• Hub location under competition (Q322435) (← links)
• A compact linearisation of Euclidean single allocation hub location problems (Q325380) (← links)
• Lower bounding procedures for the single allocation hub location problem (Q325391) (← links)
• Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks (Q336554) (← links)
• A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
• Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
• The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques (Q342143) (← links)
• A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion (Q408393) (← links)
• An \(M/M/c\) queue model for hub covering location problem (Q409968) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems (Q491079) (← links)
• A multi-objective, hub-and-spoke model to design and manage biofuel supply chains (Q513645) (← links)
• Hub location-allocation in intermodal logistic networks (Q531438) (← links)
• An improved linearization technique for a class of quadratic 0-1 programming problems (Q691407) (← links)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
• Solving the uncapacitated hub location problem using genetic algorithms (Q707014) (← links)
• Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← links)
• Stochastic air freight hub location and flight routes planning (Q733484) (← links)
• Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem (Q742303) (← links)
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm (Q811891) (← links)
• New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← links)
• New complexity results for the \(p\)-hub median problem (Q829182) (← links)
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521) (← links)
• Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
• New simple and efficient heuristics for the uncapacitated single allocation hub location problem (Q833533) (← links)
• The \(p\)-hub center allocation problem (Q852943) (← links)
• An exact solution procedure for a cluster hub location problem (Q859914) (← links)
• A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil (Q863989) (← links)
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique (Q864018) (← links)
• A hub location problem with fully interconnected backbone and access networks (Q869014) (← links)
• Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
• Routing traffic at hub facilities (Q972437) (← links)
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation (Q992581) (← links)
• Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• A linear program for the two-hub location problem (Q1278146) (← links)
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem (Q1291636) (← 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 molecular structure matching problem (Q1361391) (← links)
• Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
• The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
• On the single-assignment \(p\)-hub center problem (Q1582051) (← 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)