The referenced vertex ordering problem: theory, applications, and solution methods (Q2165588): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Antonio Mucherino / rank
Normal rank
 
Property / author
 
Property / author: Antonio Mucherino / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.5802/ojmo.8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3011571374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced vertex-orderings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discretization vertex orders in distance geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5489870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensor network localization, Euclidean distance matrix completions, and graph realization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal partial discretization orders for discretizable distance geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting-plane algorithm for solving a weighted influence interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discretization orders for distance geometry problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discretizable molecular distance geometry problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Distance Geometry and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Molecular distance geometry methods: from continuous to discrete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of realizations of certain Henneberg graphs arising in protein conformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Identification of Discretization Orders for Distance Geometry with Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discretizable distance geometry problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming approach for the search of discretization orders in distance geometry problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex ordering with optimal number of adjacent predecessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank

Latest revision as of 21:58, 29 July 2024

scientific article
Language Label Description Also known as
English
The referenced vertex ordering problem: theory, applications, and solution methods
scientific article

    Statements

    The referenced vertex ordering problem: theory, applications, and solution methods (English)
    0 references
    0 references
    0 references
    20 August 2022
    0 references
    vertex ordering
    0 references
    distance geometry
    0 references
    branch-and-bound
    0 references
    integer programming
    0 references
    valid inequalities
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references