A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels

DOI10.1007/978-3-319-45587-7_21zbMath1452.90205OpenAlexW2517619458MaRDI QIDQ2835680

Christopher Strothmann, Borzou Rostami, Christoph Buchheim

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_21

zbMATH Keywords

Lagrangian relaxationhub locationcapacity decisions

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Reliable single allocation hub location problem under hub breakdowns

Cites Work

• Unnamed Item
• A compact linearisation of Euclidean single allocation hub location problems
• Lower bounding procedures for the single allocation hub location problem
• A quadratic integer program for the location of interacting hub facilities
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Solution algorithms for the capacitated single allocation hub location problem
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• A branch and cut algorithm for hub location problems with single assignment
• 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
• Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Airline network design and hub location problems

This page was built for publication: A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels