Pages that link to "Item:Q1762033"

The following pages link to Improved LP-based algorithms for the closest string problem (Q1762033):

Displaying 9 items.

• The selective fixing algorithm for the closest string problem (Q336747) (← links)
• Improved optimization modelling for the closest string and related problems (Q651767) (← links)
• An improved algorithm for solving the banded cyclic string-to-string correction problem (Q1129017) (← links)
• An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
• An improved integer linear programming formulation for the closest 0-1 string problem (Q1652195) (← links)
• Heuristic approaches to the distinguishing substring selection problem (Q1791942) (← links)
• LP-based heuristics for the distinguishing string and substring selection problems (Q2675721) (← links)
• A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718) (← links)