pre-characterize all 30 instances, but only those that have not been solved by the greedy heuristics (Algorithm \[alg:GSIH\]) that is used to initialize the reverse annealing procedure. For those instances we are facing a three-parameter optimization ($|J_F|$, $\rho$, $s_p$).

=\[font=\]

coordinates[(42, 6.0)(48, 7.0)(54, 7.0)(60, 8.0)]{}; coordinates[(42, 7.0)(48, 6.5)(54, 7.5)(60, 7.0)]{}; coordinates[(42, 6.0)(48, 6.5)(54, 7.5)(60, 8.5)]{}; coordinates [ (24, 3.5)(30, 4.5)(36, 5.5)(42, 6)(48, 7)(54, 7) ]{}; table\[meta=label\] [ x y label 24 3.0 a 24 3.5 g 24 4.0 a 24 4.5 a 24 5.0 am 24 6.0 al 30 3.0 a 30 4.0 a 30 4.5 g 30 5.0 a 30 5.5 a 30 6.0 am 30 6.5 al 36 3.5 am 36 4.5 a 36 5.0 al 36 5.5 g 36 6.0 a 36 6.5 a 36 7.0 a 42 5.0 am 42 5.5 a 42 6.0 g 42 6.5 am 42 7.0 am 42 7.5 al 42 8.0 a 48 5.5 al 48 6.0 al 48 6.5 a 48 7.0 g 48 7.5 am 48 8.0 am 54 5.5 a 54 6.0 a 54 6.5 al 54 7.0 g 54 7.5 a 54 8.0 a ]{};

 

=\[font=\]

plot coordinates[ (1, 0.387) -= (1, 0.054) += (1, 0.054) (8, 