An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
From MaRDI portal
Publication:4427337
DOI10.1287/ijoc.10.2.149zbMath1034.90505OpenAlexW2127962171MaRDI QIDQ4427337
Mohan Krishnamoorthy, Andreas T. Ernst
Publication date: 1998
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.10.2.149
Related Items (51)
New formulations for the uncapacitated multiple allocation hub location problem ⋮ Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Spatial analysis of single allocation hub location problems ⋮ Aggregation in hub location problems ⋮ A 2-phase algorithm for solving the single allocation \(p\)-hub center problem ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ The hub location and pricing problem ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ Exact approaches for static data segment allocation problem in an information network ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ Incremental optimization of hub and spoke network for the spokes' numbers and flow ⋮ Hub Location as the Minimization of a Supermodular Set Function ⋮ Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ The single allocation problem in the interacting three-hub network ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem ⋮ 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 ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ Allocation strategies in hub networks ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ Matheuristics for optimizing the network in German wagonload traffic ⋮ The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network ⋮ Preprocessing and cutting for multiple allocation hub location problems. ⋮ The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems ⋮ An intermodal hub location problem for container distribution in Indonesia ⋮ Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Alternate second order conic program reformulations for hub location under stochastic demand and congestion ⋮ Location of facility based on simulated annealing and ``ZKW algorithms ⋮ Star \(p\)-hub median problem with modular arc capacities ⋮ A fuzzy programming approach for dynamic virtual hub location problem ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ 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 ⋮ Facility location models for distribution system design ⋮ A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems ⋮ Perspectives on modeling hub location problems ⋮ HubLocator: An exact solution method for the multiple allocation hub location problem ⋮ Stochastic air freight hub location and flight routes planning ⋮ Uncapacitated single and multiple allocation \(p\)-hub center problems ⋮ On the Quadratic Programming Approach for Hub Location Problems ⋮ The tree of hubs location problem ⋮ The capacitated multiple allocation hub location problem: Formulations and algorithms ⋮ SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM ⋮ Hub Location Problems: The Location of Interacting Facilities ⋮ Solving large single allocation \(p\)-hub problems with two or three hubs ⋮ Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
This page was built for publication: An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
