New complexity results for the p-hub median problem

DOI10.1007/S10479-018-2824-0MaRDI QIDQ829182zbMATH OpenOpenAlexFDO

Authors Hüseyin Güden

Publication date 5 May 2021

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-018-2824-0

zbMATH Keywords

complexitytransportation\(p\)-hub median problemnonlinear objective functiondiscount models

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• Uncapacitated single and multiple allocation \(p\)-hub center problems
• Hub Location and the p-Hub Median Problem
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• On the single-assignment \(p\)-hub center problem

Cites work

• A clustering approach to the planar hub location problem
• A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
• A linear program for the two-hub location problem
• A quadratic integer program for the location of interacting hub facilities
• Capacitated single allocation hub location problem-A bi-criteria approach
• Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
• Enumeration and search procedures for a hub location problem with economies of scale
• Location and allocation for distribution systems with transshipments and transportion economies of scale
• Multi-period hub network design problems with modular capacities
• Network hub location problems: The state of the art
• Solving the hub location problem with modular link capacities
• The hub location and routing problem
• The hub operation scheduling problem
• Tight linear programming relaxations of uncapacitated p-hub median problems

Cited in

(3)

• Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem
• An approximation algorithm for the \(p\)-hub median problem
• Complexity results for extensions of median orders to different types of remoteness

This page was built for publication: New complexity results for the \(p\)-hub median problem

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