
doi: 10.1007/bfb0120914
A theoretical framework for improvement heuristic methods, as applied to discrete optimization problems, is put forward. The problem of choosing a suitable set of start points, from which to perform hill-climbs, is identified and some possible solutions considered. Numerical results are presented.
heuristic improvement methods, hill climbing, discrete optimization, Boolean programming, choice of starting solutions
heuristic improvement methods, hill climbing, discrete optimization, Boolean programming, choice of starting solutions
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
