ILP-based reduced variable neighborhood search for large-scale minimum common string partition
type: Item
instance of: scholarly article
title: ILP-based reduced variable neighborhood search for large-scale minimum common string partition
zbMATH Open document ID: 1408.90332
author: Christian Blum
publication date: 2018-10-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 6951739
zbMATH Keywords: minimum common string partition
zbMATH Keywords: reduced variable neighborhood search
zbMATH Keywords: integer linear programming
MaRDI profile type: Publication
full work available at URL: j.endm.2018.03.003
OpenAlex ID: W2796532911
cites work: Mathematical programming strategies for solving the minimum common string partition problem
cites work: Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
cites work: Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
cites work: Solving the minimum common string partition problem with the help of ants
cites work: Algorithms and Computation
cites work: Variable neighborhood search
DOI: 10.1016/J.ENDM.2018.03.003
description: scientific article; zbMATH DE number 6951739