Branch-and-price-and-cut algorithm for the capacitated single allocation hub location routeing problem-Reference-Cited by-同舟云学术

Branch-and-price-and-cut algorithm for the capacitated single allocation hub location routeing problem

Published:2023-04-07 Issue: Volume: Page:1-13
ISSN:0160-5682
Container-title:Journal of the Operational Research Society
language:en
Short-container-title:Journal of the Operational Research Society

Author:

Wu Yuehui¹,Qureshi Ali Gul¹,Yamada Tadashi¹,Yu Shanchuan²

Affiliation:

1. Department of Urban Management, Graduate School of Engineering, Kyoto University, Kyoto, Japan

2. National Engineering and Research Center for Mountainous Highways, China Merchants Chongqing Communications Research & Design Institute Co. Ltd, Chongqing, China

Publisher

Informa UK Limited

Subject

Marketing,Management Science and Operations Research,Strategy and Management,Management Information Systems

Link

https://www.tandfonline.com/doi/pdf/10.1080/01605682.2023.2197933

Reference44 articles.

1. An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem

2. Perspectives on modeling hub location problems

3. Separating capacity constraints in the CVRP using tabu search

4. A Branch-and-Cut method for the Capacitated Location-Routing Problem

5. Bostel, N., Dejax, P. & Zhang, M. (2015, October). A model and a metaheuristic method for the hub location routing problem and application to postal services. 2015 International Conference on Industrial Engineering and Systems Management (IESM) (pp. 1383–1389). IEEE. https://doi.org/10.1109/IESM.2015.7380332

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Stochastic regional-based profit-maximizing hub location problem: A sustainable overview;Omega;2023-12