Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods-Reference-Cited by-同舟云学术

Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods

Published:2020-01-28 Issue:1 Volume:28 Page:296-326
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Shibasaki Rui S.¹²^ORCID,Baiou Mourad²,Barahona Francisco³,Mahey Philippe²,Souza Mauricio C.⁴^ORCID

Affiliation:

1. PPGEPUniversidade Federal de Minas GeraisAv. Antônio Carlos, 6627 31270‐901 Belo Horizonte Brazil

2. LIMOSUniversité Clermont‐Auvergne1 rue de la Chebarde 63178 Aubière France

3. Thomas J. Watson Research CenterIBM1101 Kitchawan Road Yorktown Heights NY USA

4. DEPUniversidade Federal de Minas GeraisAv. Antônio Carlos, 6627 31270‐901 Belo Horizonte Brazil

Funder

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Fundação de Amparo à Pesquisa do Estado de Minas Gerais

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.12770

Reference48 articles.

1. The volume algorithm revisited: relation with bundle methods

2. The volume algorithm: producing primal solutions with a subgradient method

3. Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut

4. Comparison of bundle and classical column generation

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

1. Freight transport using additional railcars attached to intercity passenger trains with transshipment and railcar circulation: Tabu-search-based Lagrangian heuristic;Transportation Research Part E: Logistics and Transportation Review;2023-10

2. A survey on network design problems: main variants and resolution approaches;European J. of Industrial Engineering;2023

3. Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem;International Transactions in Operational Research;2021-08-03