ILP-based reduced variable neighborhood search for large-scale minimum common string partition
From MaRDI portal
Recommendations
- Mathematical programming strategies for solving the minimum common string partition problem
- Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
- Solving the minimum common string partition problem with the help of ants
- Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
- Quick greedy computation for minimum common string partitions
Cites work
- Algorithms and Computation
- 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
- Mathematical programming strategies for solving the minimum common string partition problem
- Solving the minimum common string partition problem with the help of ants
- Variable neighborhood search
Cited in
(4)- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Mathematical programming strategies for solving the minimum common string partition problem
- Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
- Minimum common string partition: on solving large‐scale problem instances
This page was built for publication: ILP-based reduced variable neighborhood search for large-scale minimum common string partition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791896)