Minimum common string partition: on solving large-scale problem instances-Reference-Cited by-同舟云学术

Minimum common string partition: on solving large-scale problem instances

Published:2018-10-09 Issue:1 Volume:27 Page:91-111
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Blum Christian¹^ORCID

Affiliation:

1. Artificial Intelligence Research Institute (IIIA-CSIC), Campus of the UAB; Carrer de Can Planas 08193 Bellaterra Spain

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.12603/fullpdf

Reference30 articles.

1. ILP-based reduced variable neighborhood search for large-scale minimum common string partition;Blum;Electronic Notes in Discrete Mathematics,2018

2. Metaheuristics for String Problems in Bio-Informatics

3. Mathematical programming strategies for solving the minimum common string partition problem;Blum;European Journal of Operational Research,2015

4. Construct, merge, solve and adapt: a new general algorithm for combinatorial optimization;Blum;Computers & Operations Research,2016

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

1. Introduction to CMSA;Computational Intelligence Methods and Applications;2024

2. On the role of metaheuristic optimization in bioinformatics;International Transactions in Operational Research;2022-06-16

3. On Solving the Minimum Common String Partition Problem by Decision Diagrams;Proceedings of the 11th International Conference on Operations Research and Enterprise Systems;2022

4. A comparative analysis of two matheuristics by means of merged local optima networks;European Journal of Operational Research;2021-04