Pages that link to "Item:Q3011861"
From MaRDI portal
The following pages link to Quick Greedy Computation for Minimum Common String Partitions (Q3011861):
Displaying 4 items.
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization (Q342297) (← links)
- Mathematical programming strategies for solving the minimum common string partition problem (Q2630223) (← links)
- Computational performance evaluation of two integer linear programming models for the minimum common string partition problem (Q5963700) (← links)
- Minimum common string partition: on solving large‐scale problem instances (Q6088232) (← links)
