Benders Decomposition for Large-Scale Uncapacitated Hub Location
From MaRDI portal
Publication:2893920
DOI10.1287/opre.1110.0965zbMath1242.90094MaRDI QIDQ2893920
Gilbert Laporte, Jean-François Cordeau, Iván A. Contreras
Publication date: 26 June 2012
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/28ff6607f4c64c49979b089587daa1272206c75f
90B80: Discrete location and assignment
Related Items
A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems, Stochastic Planning and Scheduling with Logic-Based Benders Decomposition, Single Allocation Hub Location with Heterogeneous Economies of Scale, The Star Degree Centrality Problem: A Decomposition Approach, Iterative Prediction-and-Optimization for E-Logistics Distribution Network Design, Exact First-Choice Product Line Optimization, The Benders Dual Decomposition Method, Allocating nodes to hubs for minimizing the hubs processing resources: A case study, A two‐stage hub location method for air transportation in Brazil, A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale, A branch‐and‐cut algorithm for hub network design problems with profits, Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation, A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services, Multiple allocation hub location with service level constraints for two shipment classes, A new formulation and branch-and-cut method for single-allocation hub location problems, Hub location problems with price sensitive demands, Robust optimization approach to capacitated single and multiple allocation hub location problems, A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty, A Stackelberg hub arc location model for a competitive environment, A branch-and-cut algorithm for the hub location and routing problem, Exact approaches for static data segment allocation problem in an information network, Stochastic uncapacitated hub location, A capacitated hub location problem under hose demand uncertainty, An exact algorithm for the modular hub location problem with single assignments, Benders decomposition applied to a robust multiple allocation incomplete hub location problem, Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems, \(p\)-hub median problem for non-complete networks, Exact and heuristic approaches for the cycle hub location problem, Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment, The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems, A Benders decomposition approach for solving the offshore wind farm installation planning at the North Sea, The Benders decomposition algorithm: a literature review, A new cross decomposition method for stochastic mixed-integer linear programming, Service location grouping and pricing in transportation: application in air cargo, Multiple allocation hub interdiction and protection problems: model formulations and solution approaches, A new formulation and an exact approach for the many-to-many hub location-routing problem, General network design: a unified view of combined location and network design problems, New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem, Solving the optimum communication spanning tree problem, Benders decomposition algorithms for two variants of the single allocation hub location problem, The hub location problem with market selection, Stochastic single-allocation hub location, Perspectives on modeling hub location problems, Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule, The hub location and pricing problem, Benders decomposition applied to profit maximizing hub location problem with incomplete hub network, Stochastic hub location problems with Bernoulli demands, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, On carriers collaboration in hub location problems, Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse, Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints, Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs, Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment, A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system, Multicut Benders decomposition algorithm for process supply chain planning under uncertainty, The planar hub location problem: a probabilistic clustering approach, Dantzig-Wolfe decomposition for the facility location and production planning problem, Multiple allocation tree of hubs location problem for non-complete networks, Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem, Decomposition algorithms for solving the minimum weight maximal matching problem, Hub Location as the Minimization of a Supermodular Set Function
