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

DOI10.1007/978-3-319-45587-7_21zbMATH Open1452.90205OpenAlexW2517619458MaRDI QIDQ2835680FDOQ2835680

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

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

zbMATH Keywords

Lagrangian relaxationhub locationcapacity decisions

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Preprocessing and cutting for multiple allocation hub location problems.
• Reliable single allocation hub location problem under hub breakdowns

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)