New complexity results for the \(p\)-hub median problem

DOI10.1007/s10479-018-2824-0zbMath1464.90012OpenAlexW2795710122MaRDI QIDQ829182

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)

Cites Work

• Multi-period hub network design problems with modular capacities
• Location and allocation for distribution systems with transshipments and transportion economies of scale
• 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 quadratic integer program for the location of interacting hub facilities
• A linear program for the two-hub location problem
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
• The hub location and routing problem
• Enumeration and search procedures for a hub location problem with economies of scale
• Solving the hub location problem with modular link capacities
• Network hub location problems: The state of the art
• Capacitated single allocation hub location problem-A bi-criteria approach
• The Hub Operation Scheduling Problem

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