Improved LP-based algorithms for the closest string problem

Croce, Federico Della; Salassa, Fabio

doi:10.1016/j.cor.2011.06.010

Cited by 10 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper we propose an exact approach for KPS relying on an effective exploration of the solution space which exploits the partitioning of the variables set into two levels and requires the solution of several ILP models that show up to be easy to solve in practice. While the idea of approaching a combinatorial optimization problem by solving related simpler ILP formulations was already done in heuristic procedures (see, for instance, [9] for the closest string problem), here we do it within an exact approach. The proposed approach is capable of solving to optimality, in limited time, all instances with up to 100000 variables.…”

Section: Introductionmentioning

confidence: 99%

An exact approach for the 0–1 knapsack problem with setups

Croce

Salassa

Scatamacchia

2017

Computers & Operations Research

View full text Add to dashboard Cite

We consider the 0-1 Knapsack Problem with Setups. We propose an exact approach which handles the structure of the ILP formulation of the problem. It relies on partitioning the variables set into two levels and exploiting this partitioning. The proposed approach favorably compares to the algorithms in literature and to solver CPLEX 12.5 applied to the ILP formulation. It turns out to be very effective and capable of solving to optimality, within limited CPU time, all instances with up to 100000 variables.

show abstract

Section: Introductionmentioning

confidence: 99%