Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem-Reference-Cited by-同舟云学术

Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem

Published:2018-05-29 Issue:2 Volume:26 Page:615-641
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Clímaco Glaubos¹,Rosseti Isabel²,Simonetti Luidi¹,Guerine Marcos²

Affiliation:

1. Departamento de Engenharia de Sistemas e Computação; Cidade Universitária, Centro de Tecnologia, Universidade Federal do Rio de Janeiro; Bloco H 21941-972 Rio de Janeiro Brazil

2. Instituto de Computação; Universidade Federal Fluminense; Rua Passo da Pátria 156, Bloco E - 3° andar, São Domingos 24210-240 Niterói Rio de Janeiro Brazil

Funder

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro

Publisher

Wiley

Subject

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

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/itor.12563/fullpdf

Reference19 articles.

1. Probability distribution of solution time in GRASP: an experimental investigation;Aiex;Journal of Heuristics,2002

2. TTTplots: a perl program to create time-to-target plots;Aiex;Optimization Letters,2006

3. A practical three-phase ILP approach for solving the examination timetabling problem;Al-Hawari;International Transactions in Operational Research,2017

4. A hybrid optimization approach for multi-level capacitated lot-sizing problems;Almeder;European Journal of Operational Research,2010

5. A hybrid data mining GRASP with path-relinking;Barbalho;Computers & Operations Research,2013

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

1. Reactive GRASP for the Prize-collecting Covering Tour Problem;RAIRO - Operations Research;2021-05

2. A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem;RAIRO - Operations Research;2021

3. A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem;International Transactions in Operational Research;2019-09-30

4. Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem;International Transactions in Operational Research;2018-05-29