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 article described in :
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. Omer, A. Mucherino. Referenced Vertex Ordering Problem: Theory, Applications and Solution Methods. 2020. <hal-02509522>" [1]
THe code also reproduces solutiion methods described in
THe code also reproduces solutiion 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
"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
"M. MacNeil, M. Bodur. Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems. 2019. <arXiv:1907.12468>" [3]
"M. MacNeil, M. Bodur. Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems. 2019. <arXiv:1907.12468>" [3]
