An exact algorithm for the modular hub location problem with single assignments
From MaRDI portal
Publication:1652348
DOI10.1016/j.cor.2017.03.006zbMath1458.90462MaRDI QIDQ1652348
Navneet Vidyarthi, Moayad Tanash, Iván A. Contreras
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.03.006
90B80: Discrete location and assignment
Related Items
Single Allocation Hub Location with Heterogeneous Economies of Scale, On hub location problems in geographically flexible networks, Heuristics for the capacitated modular hub location problem, Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem, Multiple allocation hub interdiction and protection problems: model formulations and solution approaches, Less is more: general variable neighborhood search for the capacitated modular hub location problem, Perspectives on modeling hub location problems, Stochastic hub location problems with Bernoulli demands, Planning and design of intermodal hub networks: a literature review, Skyport location problem for urban air mobility system, Hub location problem considering spoke links with incentive-dependent capacities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- Adapting polyhedral properties from facility to hub location problems
- Tight bounds from a path based formulation for the tree of hub location problem
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Network cost minimization using threshold-based discounting
- A branch and cut algorithm for hub location problems with single assignment
- Enumeration and search procedures for a hub location problem with economies of scale
- Lagrangean relaxation. (With comments and rejoinder).
- A generalized subgradient method with relaxation step
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Solving the hub location problem with modular link capacities
- Star \(p\)-hub median problem with modular arc capacities
- Network hub location problems: The state of the art
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
- Hub Location as the Minimization of a Supermodular Set Function
- ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Projecting the flow variables for hub location problems
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
- Fast Approximation Algorithms for Knapsack Problems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Solving the hub location problem in a star–star network
