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

DOI10.1111/ITOR.12603MaRDI QIDQ6088232zbMATH OpenOpenAlexWikidataFDO

Authors Christian Blum

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

zbMATH Keywords

large-scale problem instancesminimum common string partitionreduced variable neighborhood search

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Minimum common string partition problem: hardness and approximations
• Algorithms and Computation
• scientific article; zbMATH DE number 7740890
• Minimum common string partition revisited
• Minimum common string partition revisited
• Exponential and polynomial time algorithms for the minimum common string partition problem
• Quick greedy computation for minimum common string partitions
• Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• The greedy algorithm for the minimum common string partition problem

Cites work

• A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
• A VNS-LP algorithm for the robust dynamic maximal covering location problem
• Algorithms and Computation
• Algorithms on Strings, Trees and Sequences
• An extension on ``Statistical comparisons of classifiers over multiple data sets for all pairwise comparisons
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: which one works better when?
• scientific article; zbMATH DE number 2087046 (Why is no real title available?)
• ILP-based reduced variable neighborhood search for large-scale minimum common string partition
• Introduction to Information Retrieval
• Mathematical Foundations of Computer Science 2005
• Mathematical programming strategies for solving the minimum common string partition problem
• Minimum common string partition revisited
• Quick greedy computation for minimum common string partitions
• Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
• Solving the minimum common string partition problem with the help of ants
• The string edit distance matching problem with moves
• Variable neighborhood search
• Variable neighborhood search for the pharmacy duty scheduling problem

Cited in

(5)

• A comparative analysis of two matheuristics by means of merged local optima networks
• Minimum common string partition revisited
• Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
• Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
• On the role of metaheuristic optimization in bioinformatics

This page was built for publication: Minimum common string partition: on solving large‐scale problem instances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6088232)