A C++ code for the solution of a vertex ordering optimization problem, MIN REVORDER, where vertices have required and desired numbers of adjacent predecessors. The main contribution of this code is in the implementation of the branch-and-bound algorithm described in :

"J. Omer, A. Mucherino. Referenced Vertex Ordering Problem: Theory, Applications and Solution Methods. 2020. <hal-02509522>" [1]

"Jérémy Omer, Antonio Mucherino. Referenced Vertex Ordering Problem: Theory, Applications and Solution Methods. Open Journal of Mathematical Optimization, Centre Mersenne, 2021, 2 (6), ⟨10.5802/ojmo.8⟩" [1]

THe code also reproduces solutiion methods described in

The code also reproduces solution methods described in

"J. Omer and D. Gonçalves. An integer programming approach for the search of discretization orders in distance geometry problems. Optimization Letters. 2017." [2], and

...

...

@@ -52,6 +52,6 @@ The option values corresponding to the versions compared in [1] are given in the

If the code is useful to your research, please cite:

"J. Omer, A. Mucherino. Referenced Vertex Ordering Problem: Theory, Applications and Solution Methods. 2020. ⟨hal-02509522⟩"

"Jérémy Omer, Antonio Mucherino. Referenced Vertex Ordering Problem: Theory, Applications and Solution Methods. Open Journal of Mathematical Optimization, Centre Mersenne, 2021, 2 (6), ⟨10.5802/ojmo.8⟩"