The referenced vertex ordering problem: theory, applications, and solution methods
From MaRDI portal
Publication:2165588
DOI10.5802/ojmo.8zbMath1497.90181OpenAlexW3011571374MaRDI QIDQ2165588
Jérémy Omer, Antonio Mucherino
Publication date: 20 August 2022
Published in: OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5802/ojmo.8
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Discretization vertex orders in distance geometry
- Discretization orders for distance geometry problems
- The discretizable molecular distance geometry problem
- Balanced vertex-orderings of graphs
- The discretizable distance geometry problem
- An integer programming approach for the search of discretization orders in distance geometry problems
- A cutting-plane algorithm for solving a weighted influence interdiction problem
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Optimal partial discretization orders for discretizable distance geometry
- Molecular distance geometry methods: from continuous to discrete
- Integer Programming Formulation of Traveling Salesman Problems
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Algorithmic Aspects of Vertex Elimination on Graphs
- Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems
- Vertex ordering with optimal number of adjacent predecessors
- Euclidean Distance Geometry and Applications
- On the Identification of Discretization Orders for Distance Geometry with Intervals
- Benchmarking optimization software with performance profiles.
This page was built for publication: The referenced vertex ordering problem: theory, applications, and solution methods
