A decomposition approach for single allocation hub location problems with multiple capacity levels

DOI10.1007/978-3-319-45587-7_21MaRDI QIDQ2835680zbMATH OpenOpenAlexFDO

Authors Borzou Rostami, Christopher Strothmann, 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)

Recommendations

• Solving a capacitated hub location problem
• Lagrangean relaxation for the capacitated hub location problem with single assignment
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Formulating and solving splittable capacitated multiple allocation hub location problems
• Branch and price for large-scale capacitated hub location problems with single assignment

Cites work

• A branch and cut algorithm for hub location problems with single assignment
• A compact linearisation of Euclidean single allocation hub location problems
• A quadratic integer program for the location of interacting hub facilities
• Airline network design and hub location problems
• Branch and price for large-scale capacitated hub location problems with single assignment
• Capacitated single allocation hub location problem-A bi-criteria approach
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Hub location problems in urban traffic networks
• Integer programming formulations of discrete hub location problems
• Lower bounding procedures for the single allocation hub location problem
• Network hub location problems: The state of the art
• Solution algorithms for the capacitated single allocation hub location problem
• Solving the hub location problem with modular link capacities
• Tight linear programming relaxations of uncapacitated p-hub median problems

Cited in

(5)

• Preprocessing and cutting for multiple allocation hub location problems.
• Reliable single allocation hub location problem under hub breakdowns
• Capacitated single allocation hub location problem-A bi-criteria approach
• Spatial and objective decompositions for very large SCAPs
• Single allocation hub location with heterogeneous economies of scale

This page was built for publication: A decomposition approach for single allocation hub location problems with multiple capacity levels

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