Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem

DOI10.1016/j.ejor.2018.03.021zbMath1403.90485arXiv1703.06581MaRDI QIDQ1754726

Xianqiang Yang

Publication date: 31 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.06581

zbMATH Keywords

networks; branch-and-cut; Benders decomposition; Pareto-optimality

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B10: Deterministic network models in operations research

90B80: Discrete location and assignment

Uses Software

• Gurobi