**Subsections**

##

`paretogreedy`

Improve a Pareto frontier approximation.

The `paretogreedy` command is invoked either as:

`paretogreedy` *Options*
`paretogreedy` *Anytime*

The `paretogreedy` command tries to improve an existing Pareto frontier approximation. It uses the bi-objective multipoint likelihood criterion and the number of breakpoints criterion to assess and improve maps in the frontier. The command starts from all the maps stored into the heap. The 2-change neighborhood (reversing any subsection of the map) is visited for each map. Each time a non dominated map is found, it is stored into the heap, updating the frontier. The algorithm stops when all the maps have been visited. The *Anytime* ratio controls the tradeoff between search speed and solution quality. The total neighborhood size is equal to
. It is partially explored, depending on the *Anytime* ratio, but at least neighbors are explored for each map in the frontier.

*Options* : `-u` to obtain the synopsis of the normal
use, `-h` to print a one line description, `-H` to
print a short help.
*Anytime*: the %age (between 1 and 100) of the neighborhood
explored. A value 100% means all the possible flips
(i.e. reversing the order of a consecutive sublist of markers) are
examined. A smaller strictly positive value will speed up the
search, improving solution quality faster at the beginning of the
search. But solution quality may be altered at the end. A typical
value is 25%.

nothing. All the map explored by the algorithm are candidate for the heap.

Thomas Schiex
2009-10-27