An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
From MaRDI portal
Publication:4427337
Recommendations
- Hub Location and the p-Hub Median Problem
- scientific article; zbMATH DE number 1803765
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
Cited in
(68)- Multiple allocation tree of hubs location problem for non-complete networks
- A new formulation and branch-and-cut method for single-allocation hub location problems
- Bicriteria \(p\)-hub location problems and evolutionary algorithms
- 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
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- New complexity results for the \(p\)-hub median problem
- Star \(p\)-hub median problem with modular arc capacities
- Allocation strategies in hub networks
- Exact optimal solutions of the minisum facility and transfer points location problems on a network
- Facility location models for distribution system design
- Location of facility based on simulated annealing and ``ZKW algorithms
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- New formulations for the uncapacitated multiple allocation hub location problem
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- HubLocator: An exact solution method for the multiple allocation hub location problem
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- The tree of hubs location problem
- Incremental optimization of hub and spoke network for the spokes' numbers and flow
- Exact solution of hub network design problems with profits
- The single allocation problem in the interacting three-hub network
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- An exact solution procedure for a cluster hub location problem
- \(p\)-hub median problem for non-complete networks
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Integer programming formulations of discrete hub location problems
- Preprocessing and cutting for multiple allocation hub location problems.
- Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
- Spatial analysis of single allocation hub location problems
- Stochastic air freight hub location and flight routes planning
- The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo 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
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- A capacitated hub location problem under hose demand uncertainty
- Hub location problems: the location of interacting facilities
- A 2-phase algorithm for solving the single allocation p-hub center problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- An exact algorithm for the modular hub location problem with single assignments
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- Solving the hub location problem in a star–star network
- A branch-and-cut algorithm for the hub location and routing problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Exact approaches for static data segment allocation problem in an information network
- Solving large single allocation \(p\)-hub problems with two or three hubs
- A multiobjective hub-airport location problem for an airline network design
- Network hub location problems: The state of the art
- Models and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub equitable center problem
- An approximation algorithm for the \(p\)-hub median problem
- A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Aggregation in hub location problems
- Exact and heuristic approaches for the cycle hub location problem
- Solving the continuous multiple allocation \(p\)-hub median problem by the hyperbolic smoothing approach
- On the Quadratic Programming Approach for Hub Location Problems
- Hub location as the minimization of a supermodular set function
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Capacitated single allocation hub location problem-A bi-criteria approach
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- Star p-hub center problem and star p-hub median problem with bounded path lengths
- Hub Location and the p-Hub Median Problem
- Matheuristics for optimizing the network in German wagonload traffic
- An efficient algorithm for solving the median problem on real road networks
- The most probable allocation solution for the \(p\)-median problem
- Perspectives on modeling hub location problems
- A fuzzy programming approach for dynamic virtual hub location problem
- The hub location and pricing problem
This page was built for publication: An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427337)
