Minimum common string partition: on solving large‐scale problem instances (Q6088232): Difference between revisions

@@ Property / cites work @@
+ILP-based reduced variable neighborhood search for large-scale minimum common string partition
+Normal rank
@@ Property / cites work @@
+Mathematical programming strategies for solving the minimum common string partition problem
+Normal rank
@@ Property / cites work @@
+Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+The string edit distance matching problem with moves
+Normal rank
@@ Property / cites work @@
+Solving the minimum common string partition problem with the help of ants
+Normal rank
@@ Property / cites work @@
+Q3096211
@@ Property / cites work: Q3096211 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Quick Greedy Computation for Minimum Common String Partitions
+Normal rank
@@ Property / cites work @@
+Algorithms on Strings, Trees and Sequences
@@ Property / cites work: Algorithms on Strings, Trees and Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum common string partition revisited
@@ Property / cites work: Minimum common string partition revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the pharmacy duty scheduling problem
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
+Normal rank
@@ Property / cites work @@
+Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?
+Normal rank
@@ Property / cites work @@
+Introduction to Information Retrieval
@@ Property / cites work: Introduction to Information Retrieval / rank @@
+Normal rank
@@ Property / cites work @@
+A VNS-LP algorithm for the robust dynamic maximal covering location problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737692
@@ Property / cites work: Q4737692 / rank @@
+Normal rank
@@ Property / cites work @@
+A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
+Normal rank