The selective fixing algorithm for the closest string problem
Year of publication: |
2014
|
---|---|
Authors: | Della Croce, Federico ; Garraffa, Michele |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 41.2014, p. 24-30
|
Subject: | Closest string problem | Heuristics | Continuous relaxation | Theorie | Theory | Heuristik | Algorithmus | Algorithm |
-
An improved integer linear programming formulation for the closest 0-1 string problem
Arbib, Claudio, (2017)
-
Jawahar, N., (2012)
-
Čičková, Zuzana, (2013)
- More ...
-
A hybrid three-phase approach for the max-mean dispersion problem
Della Croce, Federico, (2016)
-
The one-dimensional cutting stock problem with sequence-dependent cut losses
Garraffa, Michele, (2016)
-
Balogh, Andrea, (2022)
- More ...