Minimum common string partition: on solving large‐scale problem instances
From MaRDI portal
Publication:6088232
DOI10.1111/itor.12603OpenAlexW2896836699WikidataQ129159482 ScholiaQ129159482MaRDI QIDQ6088232
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12603
Related Items (2)
On the role of metaheuristic optimization in bioinformatics ⋮ A comparative analysis of two matheuristics by means of merged local optima networks
Cites Work
- Unnamed Item
- Unnamed Item
- Variable neighborhood search for the pharmacy duty scheduling problem
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Minimum common string partition revisited
- Variable neighborhood search
- A VNS-LP algorithm for the robust dynamic maximal covering location problem
- ILP-based reduced variable neighborhood search for large-scale minimum common string partition
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- Solving the minimum common string partition problem with the help of ants
- Mathematical programming strategies for solving the minimum common string partition problem
- The string edit distance matching problem with moves
- Quick Greedy Computation for Minimum Common String Partitions
- Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?
- Introduction to Information Retrieval
- Algorithms on Strings, Trees and Sequences
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
- Mathematical Foundations of Computer Science 2005
- Algorithms and Computation
- Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
This page was built for publication: Minimum common string partition: on solving large‐scale problem instances
