Pages that link to "Item:Q1290137"

The following pages link to Solution algorithms for the capacitated single allocation hub location problem (Q1290137):

Displaying 50 items.

• 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)
• 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)
• Multi-period hub network design problems with modular capacities (Q512995) (← links)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← 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)
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique (Q864018) (← links)
• A mixed-integer approach to Core-Edge design of storage area networks (Q878574) (← links)
• Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← 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)
• Efficient algorithms for the capacitated concentrator location problem (Q1088878) (← links)
• Solution approaches to hub location problems (Q1385332) (← links)
• Location models for airline hubs behaving as \(M/D/c\) queues. (Q1423443) (← links)
• Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
• The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
• A parametric approach for a nonlinear discrete location problem (Q1598874) (← 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)
• Reliable single allocation hub location problem under hub breakdowns (Q1652650) (← links)
• An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
• An improved algorithm for fixed-hub single allocation problems (Q1697895) (← links)
• Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
• An intermodal hub location problem for container distribution in Indonesia (Q1725631) (← links)
• Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods (Q1730620) (← links)
• Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations (Q1733092) (← links)
• Hub-and-spoke network design with congestion (Q1764770) (← links)
• A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
• Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm (Q1792363) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Proprietor and customer costs in the incomplete hub location-routing network topology (Q1991436) (← links)
• A fuzzy algorithm for continuous capacitated location allocation model with risk consideration (Q1991483) (← links)
• Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
• Stochastic single-allocation hub location (Q2029287) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion (Q2052283) (← links)
• Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor (Q2076863) (← links)
• The hub location and pricing problem (Q2140288) (← links)
• Stochastic hub location problems with Bernoulli demands (Q2147142) (← links)
• Alternate second order conic program reformulations for hub location under stochastic demand and congestion (Q2241568) (← links)
• Multi-period hub set covering problems with flexible radius: a modified genetic solution (Q2289304) (← links)
• Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm (Q2295062) (← links)
• Modeling congestion and service time in hub location problems (Q2295119) (← links)