Pages that link to "Item:Q1579501"

The following pages link to The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501):

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)
• Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← 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)
• The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network (Q450150) (← links)
• Multi-period hub network design problems with modular capacities (Q512995) (← links)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← links)
• Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution (Q727374) (← links)
• Heuristics for the p-hub location problem (Q803033) (← 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)
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• A conditional \(p\)-hub location problem with attraction functions (Q833528) (← 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)
• On the enrouting protocol problem under uncertainty (Q877076) (← 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)
• Solution algorithms for the capacitated single allocation hub location problem (Q1290137) (← links)
• Efficient solution procedure and reduced size formulations for \(p\)-hub location problems (Q1296008) (← 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)
• Solving large single allocation \(p\)-hub problems with two or three hubs (Q1595449) (← links)
• Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network (Q1639274) (← links)
• A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
• Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
• Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
• Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount (Q1719220) (← 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)
• 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)
• Hub-and-spoke network design with congestion (Q1764770) (← links)
• A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
• A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
• A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
• Competition in a deregulated air transportation market (Q1840857) (← links)
• Enumeration and search procedures for a hub location problem with economies of scale (Q1872015) (← 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)