A dual algorithm for the uncapacitated hub location problem
From MaRDI portal
Publication:4228761
DOI10.1016/S0966-8349(96)00010-1zbMath0929.90049MaRDI QIDQ4228761
Publication date: 1 March 1999
Published in: Location Science (Search for Journal in Brave)
integer programmingbranch-and-bounddual ascenthub locationdual adjustmentintermediate switching points
Applications of mathematical programming (90C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (25)
New formulations for the uncapacitated multiple allocation hub location problem ⋮ Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ A conditional \(p\)-hub location problem with attraction functions ⋮ The \(p\)-hub center allocation problem ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ An exact solution procedure for a cluster hub location problem ⋮ A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil ⋮ Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique ⋮ A mixed-integer approach to Core-Edge design of storage area networks ⋮ New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem ⋮ Matheuristics: survey and synthesis ⋮ A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion ⋮ Allocation strategies in hub networks ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Location of facility based on simulated annealing and ``ZKW algorithms ⋮ Network hub location problems: The state of the art ⋮ Hub-and-spoke network design with congestion ⋮ Facility location models for distribution system design ⋮ HubLocator: An exact solution method for the multiple allocation hub location problem ⋮ 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 ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems ⋮ Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm ⋮ A hybrid heuristic for the uncapacitated hub location problem
This page was built for publication: A dual algorithm for the uncapacitated hub location problem
