Pages that link to "Item:Q2482813"

The following pages link to Network hub location problems: The state of the art (Q2482813):

Displaying 50 items.

• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation (Q992581) (← links)
• Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
• Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
• Optimizing fuzzy \( p\)-hub center problem with generalized value-at-risk criterion (Q1632000) (← links)
• Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion (Q1639271) (← links)
• Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network (Q1639274) (← links)
• The \(q\)-ad hoc hub location problem for multi-modal networks (Q1642959) (← links)
• A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
• An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
• Routing and scheduling decisions in the hierarchical hub location problem (Q1652350) (← links)
• Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
• Benders decomposition applied to a robust multiple allocation incomplete hub location problem (Q1652441) (← links)
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← links)
• \(p\)-hub median problem for non-complete networks (Q1652628) (← 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)
• A biased random-key genetic algorithm for the tree of hubs location problem (Q1676487) (← links)
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
• Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
• Logistics network design for perishable products with heterogeneous quality decay (Q1683077) (← links)
• A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
• Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
• Public transportation hub location with stochastic demand: an improved approach based on multiple attribute group decision-making (Q1723340) (← links)
• Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem (Q1725626) (← 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)
• An intermodal hub location problem for container distribution in Indonesia (Q1725631) (← links)
• OR models in urban service facility location: a critical review of applications and future developments (Q1728469) (← 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)
• A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)
• The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
• Branch-and-price-and-cut for a service network design and hub location problem (Q1752143) (← links)
• Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty (Q1752865) (← links)
• An implicit enumeration algorithm for the hub interdiction median problem with fortification (Q1754202) (← links)
• Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
• Efficient metaheuristics to solve the intermodal terminal location problem (Q1761128) (← links)
• Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths (Q1761222) (← links)
• LTL logistics networks with differentiated services (Q1761236) (← links)
• Properties of volume-capacity ratio in congested complex~networks (Q1782667) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← 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)
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (Q1926700) (← links)
• Design of intermodal logistics networks with hub delays (Q1926780) (← links)