An improved mixed integer program for single allocation hub location problems with stepwise cost function

DOI10.1111/ITOR.12270MaRDI QIDQ5364065zbMATH OpenOpenAlexFDO

Authors J. Fabian Meier

Publication date 2 October 2017

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12270

zbMATH Keywords

branch and boundhub locationcut generation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
• Solving large single allocation \(p\)-hub problems with two or three hubs
• Uncapacitated single and multiple allocation \(p\)-hub center problems
• An efficient model for the multiple allocation hub maximal covering problem
• Integer programming formulations of discrete hub location problems

Cited in

(5)

• Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem
• Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm
• Integrated optimization model for distribution network design: a case study of the clothing industry
• Integer linear programming models for grid-based light post location problem
• Perspectives on modeling hub location problems

This page was built for publication: An improved mixed integer program for single allocation hub location problems with stepwise cost function

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