ILP-based reduced variable neighborhood search for large-scale minimum common string partition (Q1791896): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Mathematical programming strategies for solving the minimum common string partition problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational performance evaluation of two integer linear programming models for the minimum common string partition problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving the minimum common string partition problem with the help of ants / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms and Computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Variable neighborhood search / rank | |||
Normal rank | |||
Revision as of 19:57, 16 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ILP-based reduced variable neighborhood search for large-scale minimum common string partition |
scientific article |
Statements
ILP-based reduced variable neighborhood search for large-scale minimum common string partition (English)
0 references
11 October 2018
0 references
minimum common string partition
0 references
reduced variable neighborhood search
0 references
integer linear programming
0 references
0 references
0 references
