Single Allocation Hub Location with Heterogeneous Economies of Scale
From MaRDI portal
Publication:5080641
DOI10.1287/opre.2021.2185zbMath1490.90190OpenAlexW3186291209MaRDI QIDQ5080641
Borzou Rostami, Okan Arslan, Masoud Chitsaz, Andrea Lodi, Gilbert Laporte
Publication date: 31 May 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2021.2185
Lagrangian relaxationtransportationquadratic programhub locationeconomies of scalebenders decompositionsingle allocation
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Stochastic uncapacitated hub location
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- A conditional \(p\)-hub location problem with attraction functions
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- 0-1 reformulations of the multicommodity capacitated network design problem
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- Network cost minimization using threshold-based discounting
- An exact algorithm for the modular hub location problem with single assignments
- Routing and scheduling decisions in the hierarchical hub location problem
- Reliable single allocation hub location problem under hub breakdowns
- Hub-and-spoke network design with congestion
- Enumeration and search procedures for a hub location problem with economies of scale
- Stochastic single-allocation hub location
- Perspectives on modeling hub location problems
- Network hub location problems: The state of the art
- Improving the Integer L-Shaped Method
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- The Latest Arrival Hub Location Problem
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Hub Arc Location Problems: Part I—Introduction and Results
- Release Time Scheduling and Hub Location for Next-Day Delivery
- Projecting the flow variables for hub location problems
- Solving the Hub location problem in telecommunication network design: A local search approach
- The Cutting-Plane Method for Solving Convex Programs
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Integer programming duality: Price functions and sensitivity analysis
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Airline network design and hub location problems
- Hub Location and the p-Hub Median Problem
