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

DOI10.1111/ITOR.12270zbMath1371.90078OpenAlexW2295069421MaRDI QIDQ5364065

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

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

Related Items (3)

Integrated optimization model for distribution network design: a case study of the clothing industry ⋮ Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm ⋮ 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