Hub Location and the p-Hub Median Problem

DOI10.1287/OPRE.44.6.923zbMATH Open0879.90127OpenAlexW2159038687MaRDI QIDQ4346344FDOQ4346344

Authors: James F. Campbell 

Publication date: 25 January 1998

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.44.6.923

Recommendations

• Approximation algorithms for median hub location problems
• An approximation algorithm for the \(p\)-hub median problem
• The \(p\)-hub center allocation problem
• The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• Single-allocation ordered median hub location problems
• \(p\)-hub median problem for non-complete networks
• Lower Bounds for the Hub Location Problem
• Heuristics for the p-hub location problem

zbMATH Keywords

heuristicshub location\(p\)-hub medianhub networks

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

• The \(p\)-hub center allocation problem
• Bicriteria \(p\)-hub location problems and evolutionary algorithms
• Title not available (Why is that?)
• Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
• Star \(p\)-hub median problem with modular arc capacities
• Allocation strategies in hub networks
• Geometric rounding: A dependent randomized rounding scheme
• Hub location-allocation in intermodal logistic networks
• Solving the uncapacitated hub location problem using genetic algorithms
• HubLocator: An exact solution method for the multiple allocation hub location problem
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• Hub location for time definite transportation
• New simple and efficient heuristics for the uncapacitated single allocation hub location problem
• An efficient model for the multiple allocation hub maximal covering problem
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• The single allocation problem in the interacting three-hub network
• The tree of hubs location problem
• Path relinking approach for multiple allocation hub maximal covering problem
• A quadratic integer program for the location of interacting hub facilities
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
• Integer programming formulations of discrete hub location problems
• Robust optimization approach to capacitated single and multiple allocation hub location problems
• Hub interdiction problem variants: models and metaheuristic solution algorithms
• A novel scale-invariant, dynamic method for hierarchical clustering of data affected by measurement uncertainty
• Preprocessing and cutting for multiple allocation hub location problems.
• An \(M/M/c\) queue model for hub covering location problem
• A hybrid heuristic for the uncapacitated hub location problem
• Endogenous effects of hubbing on flow intensities
• Spatial analysis of single allocation hub location problems
• Hub-and-spoke network design with congestion
• Single-allocation ordered median hub location problems
• Stochastic air freight hub location and flight routes planning
• Hub location problems: the location of interacting facilities
• Title not available (Why is that?)
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
• A capacitated hub location problem under hose demand uncertainty
• Exact and heuristic algorithms for the design of hub networks with multiple lines
• The planar hub location problem: a probabilistic clustering approach
• A cost allocation problem arising in hub-spoke network systems
• Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
• A multi-objective model for locating search and rescue boats
• A compact linearisation of Euclidean single allocation hub location problems
• Stochastic single-allocation hub location
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• Location models for airline hubs behaving as \(M/D/c\) queues.
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Solving large single allocation \(p\)-hub problems with two or three hubs
• Network hub location problems: The state of the art
• A multiobjective hub-airport location problem for an airline network design
• A genetic algorithm for the uncapacitated single allocation planar hub location problem
• Scatter search for an uncapacitated \(p\)-hub median problem
• Hub arc location problems: I. Introduction and results
• An approximation algorithm for the \(p\)-hub median problem
• Approximation algorithms for median hub location problems
• Improved hardness and approximation results for single allocation hub location problems
• A clustering approach to the planar hub location problem
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• Uncapacitated single and multiple allocation \(p\)-hub center problems
• Aggregation in hub location problems
• On the Location of Hub Facilities
• Location of hubs in a competitive environment
• Hub location as the minimization of a supermodular set function
• On the single-assignment \(p\)-hub center problem
• A Note on “The Latest Arrival Hub Location Problem”
• Graph clustering
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
• Capacitated single allocation hub location problem-A bi-criteria approach
• Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
• The hub location and routing problem
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
• Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem
• The FedEx problem
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
• On the selection of hub airports for an airline hub-and-spoke system
• The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
• Multiple allocation tree of hubs location problem for non-complete networks
• A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method
• A review of transport market modeling using game-theoretic principles
• An intermodal hub location problem for container distribution in Indonesia
• The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
• New complexity results for the \(p\)-hub median problem
• Alternate solution approaches for competitive hub location problems
• A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
• \(p\)-hub median problem for non-complete networks
• Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
• The p-hub centre routing problem with emissions budget: formulation and solution procedure
• A distribution map for the one-median location problem on a network
• Mathematical programming formulations and algorithms for discrete \(k\)-median clustering of time-series data
• The hub location problem with market selection
• An improved algorithm for fixed-hub single allocation problems
• A non-triangular hub location problem
• An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
• Improved hardness and approximation results for single allocation hub location
• A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems
• Hub location problem considering spoke links with incentive-dependent capacities
• Heuristic strategies for a multi-allocation problem in LTL logistics

This page was built for publication: Hub Location and the p-Hub Median Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4346344)