
doi: 10.1111/itor.12507
AbstractTime‐to‐target plots (ttt‐plots) are a useful tool to characterize, evaluate, and compare the behavior of randomized heuristics for a given problem instance of some combinatorial optimization problem. Multiple time‐to‐target plots (mttt‐plots) are their natural extension to sets of multiple instances. We show how to build an mttt‐plot from the individual ttt‐plots of each instance in the set and we illustrate several case studies to illustrate the applicability and usefulness of the new tool.
Combinatorial optimization, runtime distribution, randomized metaheuristics, multiple time-to-target plot, Approximation methods and heuristics in mathematical programming, time-to-target plot
Combinatorial optimization, runtime distribution, randomized metaheuristics, multiple time-to-target plot, Approximation methods and heuristics in mathematical programming, time-to-target plot
| 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). | 16 | |
| 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. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
