Heuristics for the p-hub location problem
From MaRDI portal
Publication:803033
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Recommendations
- Hub Location and the p-Hub Median Problem
- On tabu search for the location of interacting hub facilities
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Network hub location problems: The state of the art
Cites work
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- A quadratic integer program for the location of interacting hub facilities
- Facility location models for distribution planning
- Large-Scale Network Topological Optimization
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
Cited in
(54)- Hub location-allocation in intermodal logistic networks
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- The single allocation problem in the interacting three-hub network
- Allocation strategies in hub networks
- Star \(p\)-hub median problem with modular arc capacities
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
- The planar hub location problem: a probabilistic clustering approach
- A linear program for the two-hub location problem
- Graph clustering
- The tree of hubs location problem
- On ``A quadratic integer program for the location of interacting hub facilities
- Solving the uncapacitated hub location problem using genetic algorithms
- On tabu search for the location of interacting hub facilities
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- Optimal use of hub facilities: A two-hub model with fixed arc costs
- A polynomial algorithm for balanced clustering via graph partitioning
- scientific article; zbMATH DE number 1803765 (Why is no real title available?)
- Location of hubs in a competitive environment
- An efficient algorithm for solving the median problem on real road networks
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- An improved algorithm for fixed-hub single allocation problems
- A clustering approach to the planar hub location problem
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Reliable single allocation hub location problem under hub breakdowns
- Heuristics for budget facility location-network design problems with minisum objective
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- An efficient heuristic for a hub location routing problem
- A hybrid heuristic for the uncapacitated hub location problem
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Matheuristics for optimizing the network in German wagonload traffic
- Network hub location problems: The state of the art
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Hub Location and the p-Hub Median Problem
- scientific article; zbMATH DE number 1189257 (Why is no real title available?)
- Hub-and-spoke network design with congestion
- Hub location problems: the location of interacting facilities
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Algorithms for solving the hub construction problem with given number of hub nodes
- A hybrid genetic/optimization algorithm for a task allocation problem
- Capacitated single allocation hub location problem-A bi-criteria approach
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- Heuristics for multiple facility location in a network using the variance criterion
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- HubLocator: An exact solution method for the multiple allocation hub location problem
- Dual-based approach for a hub network design problem under non-restrictive policy
- The hub location and routing problem
- A fuzzy programming approach for dynamic virtual hub location problem
- Integer programming formulations of discrete hub location problems
- Network cost minimization using threshold-based discounting
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
This page was built for publication: Heuristics for the p-hub location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803033)
