Integer programming formulations of discrete hub location problems

DOI10.1016/0377-2217(94)90318-2zbMath0790.90048OpenAlexW2037551729MaRDI QIDQ1317166

James F. Campbell

Publication date: 13 March 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90318-2

zbMATH Keywords

telecommunication systemstransshipment\(p\)-hub medianhubsswitching pointsuncapacitated hub location

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (only showing first 100 items - show all)

Endogenous effects of hubbing on flow intensities ⋮ On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality ⋮ A cost allocation problem arising in hub-spoke network systems ⋮ The hub location and pricing problem ⋮ Competitive multiple allocation hub location problem considering primary and backup routes ⋮ Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach ⋮ A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements ⋮ Stochastic hub location problems with Bernoulli demands ⋮ On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality ⋮ Solving a capacitated hub location problem ⋮ Formulating and solving splittable capacitated multiple allocation hub location problems ⋮ Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment ⋮ Single Allocation Hub Location with Heterogeneous Economies of Scale ⋮ Hub Location as the Minimization of a Supermodular Set Function ⋮ Improved hardness and approximation results for single allocation hub location problems ⋮ Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region ⋮ A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand ⋮ The single allocation problem in the interacting three-hub network ⋮ 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 ⋮ Design of intermodal logistics networks with hub delays ⋮ An approximation algorithm for the \(p\)-hub median problem ⋮ Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ The uncapacitated r‐allocation p‐hub center problem ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands ⋮ A non-triangular hub location problem ⋮ Machine learning augmented approaches for hub location problems ⋮ Multiple allocation hub location with service level constraints for two shipment classes ⋮ Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU ⋮ The p-hub centre routing problem with emissions budget: formulation and solution procedure ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm ⋮ An alternative approach to address uncertainty in hub location ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ Mathematical Programming Formulations and Algorithms for Discrete k-Median Clustering of Time-Series Data ⋮ Alternative formulations for the obnoxious \(p\)-median problem ⋮ The planar hub location problem: a probabilistic clustering approach ⋮ A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method ⋮ Proprietor and customer costs in the incomplete hub location-routing network topology ⋮ Star \(p\)-hub median problem with modular arc capacities ⋮ Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation ⋮ Less is more: general variable neighborhood search for the capacitated modular hub location problem ⋮ Network hub location problems: The state of the art ⋮ Capacitated single allocation hub location problem-A bi-criteria approach ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ An on-demand same-day delivery service using direct peer-to-peer transshipment strategies ⋮ Dual-based approach for a hub network design problem under non-restrictive policy ⋮ A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations ⋮ The hub location problem with market selection ⋮ Unmanned aerial vehicle hub-location and routing for monitoring geographic borders ⋮ Adjustable robust balanced hub location problem with uncertain transportation cost ⋮ A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems ⋮ Alternate solution approaches for competitive hub location problems ⋮ Perspectives on modeling hub location problems ⋮ A review of transport market modeling using game-theoretic principles ⋮ HubLocator: An exact solution method for the multiple allocation hub location problem ⋮ Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs ⋮ Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design ⋮ Multi-period hub set covering problems with flexible radius: a modified genetic solution ⋮ A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming ⋮ Improved hardness and approximation results for single allocation hub location ⋮ Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system ⋮ Modeling congestion and service time in hub location problems ⋮ A bi-objective incomplete hub location-routing problem with flow shipment scheduling ⋮ A combined average-case and worst-case analysis for an integrated hub location and revenue management problem ⋮ Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs ⋮ Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems ⋮ On the Quadratic Programming Approach for Hub Location Problems ⋮ An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem ⋮ A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor ⋮ Hub Location Problems: The Location of Interacting Facilities ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems ⋮ Communication network formation with link specificity and value transferability ⋮ A competitive hub location and pricing problem ⋮ New formulations for the uncapacitated multiple allocation hub location problem ⋮ Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Hub location problems with price sensitive demands ⋮ A tabu-search based heuristic for the hub covering problem over incomplete hub networks ⋮ Multiple allocation hub-and-spoke network design under hub congestion ⋮ Hub location for time definite transportation ⋮ Tight bounds from a path based formulation for the tree of hub location problem ⋮ Aggregation in hub location problems ⋮ A 2-phase algorithm for solving the single allocation \(p\)-hub center problem ⋮ New simple and efficient heuristics for the uncapacitated single allocation hub location problem ⋮ The stochastic \(p\)-hub center problem with service-level constraints ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Upgrading nodes in tree-shaped hub location ⋮ The planar multifacility collection depots location problem ⋮ Optimizing fuzzy \( p\)-hub center problem with generalized value-at-risk criterion ⋮ Multi-product capacitated single-allocation hub location problems: formulations and inequalities ⋮ Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion ⋮ Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network ⋮ Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: an LP-MIP heuristic approach ⋮ The \(q\)-ad hoc hub location problem for multi-modal networks ⋮ Hub location under competition ⋮ Lower bounding procedures for the single allocation hub location problem ⋮ The \(p\)-hub center allocation problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Location and allocation for distribution systems with transshipments and transportion economies of scale
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• A clustering approach to the planar hub location problem
• Heuristics for the p-hub location problem
• On ``A quadratic integer program for the location of interacting hub facilities
• A comparison of two dual-based procedures for solving the p-median problem
• A quadratic integer program for the location of interacting hub facilities
• An algorithm for the quadratic assignment problem using Benders' decomposition
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• On the Location of Hub Facilities
• An Overview of Representative Problems in Location Research
• Designing satellite communication networks by zero—one quadratic programming
• Location-Allocation Problems
• A Dual-Based Procedure for Uncapacitated Facility Location
• Interacting New Facilities and Location-Allocation Problems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Large-Scale Network Topological Optimization
• Hub Location and the p-Hub Median Problem
• Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Integer programming formulations of discrete hub location problems