ILP-based reduced variable neighborhood search for large-scale minimum common string partition

DOI10.1016/j.endm.2018.03.003zbMath1408.90332OpenAlexW2796532911MaRDI QIDQ1791896

Christian Blum

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.003

zbMATH Keywords

integer linear programmingminimum common string partitionreduced variable neighborhood search

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

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

Cites Work

• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• Variable neighborhood search
• Solving the minimum common string partition problem with the help of ants
• Mathematical programming strategies for solving the minimum common string partition problem
• 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: ILP-based reduced variable neighborhood search for large-scale minimum common string partition