FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3136013197> ?p ?o ?g. }

• W3136013197 endingPage "314" @default.
• W3136013197 startingPage "297" @default.
• W3136013197 abstract "Given an integer dimension K and a simple, undirected graph G with positive edge weights, the Distance Geometry Problem (DGP) aims to find a realization function mapping each vertex to a coordinate in [Formula: see text] such that the distance between pairs of vertex coordinates is equal to the corresponding edge weights in G. The so-called discretization assumptions reduce the search space of the realization to a finite discrete one, which can be explored via the branch-and-prune (BP) algorithm. Given a discretization vertex order in G, the BP algorithm constructs a binary tree where the nodes at a layer provide all possible coordinates of the vertex corresponding to that layer. The focus of this paper is on finding optimal BP trees for a class of discretizable DGPs. More specifically, we aim to find a discretization vertex order in G that yields a BP tree with the least number of branches. We propose an integer programming formulation and three constraint programming formulations that all significantly outperform the state-of-the-art cutting-plane algorithm for this problem. Moreover, motivated by the difficulty in solving instances with a large and low-density input graph, we develop two hybrid decomposition algorithms, strengthened by a set of valid inequalities, which further improve the solvability of the problem. Summary of Contribution: We present a new model to solve a combinatorial optimization problem on graphs, MIN DOUBLE, which comes from the highly active area of distance geometry and has applications in a wide variety of fields. We use integer programming (IP) and present the first constraint programming (CP) models and hybrid decomposition methods, implemented as a branch-and-cut procedure, for MIN DOUBLE. Through an extensive computational study, we show that our approaches advance the state of the art for MIN DOUBLE. We accomplish this by not only combining generic techniques from IP and CP but also exploring the structure of the problem in developing valid inequalities and variable fixing rules. Our methods significantly improve the solvability of MIN DOUBLE, which we believe can also provide insights for tackling other problem classes and applications." @default.
• W3136013197 created "2021-03-29" @default.
• W3136013197 creator A5014659223 @default.
• W3136013197 creator A5091848765 @default.
• W3136013197 date "2022-01-01" @default.
• W3136013197 modified "2023-09-23" @default.
• W3136013197 title "Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems" @default.
• W3136013197 cites W2017850362 @default.
• W3136013197 cites W2124947072 @default.
• W3136013197 cites W2735163020 @default.
• W3136013197 cites W2953018250 @default.
• W3136013197 cites W3100538812 @default.
• W3136013197 doi "https://doi.org/10.1287/ijoc.2020.1039" @default.
• W3136013197 hasPublicationYear "2022" @default.
• W3136013197 type Work @default.
• W3136013197 sameAs 3136013197 @default.
• W3136013197 citedByCount "0" @default.
• W3136013197 crossrefType "journal-article" @default.
• W3136013197 hasAuthorship W3136013197A5014659223 @default.
• W3136013197 hasAuthorship W3136013197A5091848765 @default.
• W3136013197 hasBestOaLocation W31360131972 @default.
• W3136013197 hasConcept C114614502 @default.
• W3136013197 hasConcept C118615104 @default.
• W3136013197 hasConcept C126255220 @default.
• W3136013197 hasConcept C132525143 @default.
• W3136013197 hasConcept C134306372 @default.
• W3136013197 hasConcept C137631369 @default.
• W3136013197 hasConcept C173404611 @default.
• W3136013197 hasConcept C33923547 @default.
• W3136013197 hasConcept C52692508 @default.
• W3136013197 hasConcept C56086750 @default.
• W3136013197 hasConcept C73000952 @default.
• W3136013197 hasConcept C80899671 @default.
• W3136013197 hasConceptScore W3136013197C114614502 @default.
• W3136013197 hasConceptScore W3136013197C118615104 @default.
• W3136013197 hasConceptScore W3136013197C126255220 @default.
• W3136013197 hasConceptScore W3136013197C132525143 @default.
• W3136013197 hasConceptScore W3136013197C134306372 @default.
• W3136013197 hasConceptScore W3136013197C137631369 @default.
• W3136013197 hasConceptScore W3136013197C173404611 @default.
• W3136013197 hasConceptScore W3136013197C33923547 @default.
• W3136013197 hasConceptScore W3136013197C52692508 @default.
• W3136013197 hasConceptScore W3136013197C56086750 @default.
• W3136013197 hasConceptScore W3136013197C73000952 @default.
• W3136013197 hasConceptScore W3136013197C80899671 @default.
• W3136013197 hasIssue "1" @default.
• W3136013197 hasLocation W31360131971 @default.
• W3136013197 hasLocation W31360131972 @default.
• W3136013197 hasOpenAccess W3136013197 @default.
• W3136013197 hasPrimaryLocation W31360131971 @default.
• W3136013197 hasRelatedWork W1719252778 @default.
• W3136013197 hasRelatedWork W2003008160 @default.
• W3136013197 hasRelatedWork W2031098440 @default.
• W3136013197 hasRelatedWork W2381713449 @default.
• W3136013197 hasRelatedWork W2466894780 @default.
• W3136013197 hasRelatedWork W2731724293 @default.
• W3136013197 hasRelatedWork W2990947859 @default.
• W3136013197 hasRelatedWork W3092119098 @default.
• W3136013197 hasRelatedWork W4307385446 @default.
• W3136013197 hasRelatedWork W922283457 @default.
• W3136013197 hasVolume "34" @default.
• W3136013197 isParatext "false" @default.
• W3136013197 isRetracted "false" @default.
• W3136013197 magId "3136013197" @default.
• W3136013197 workType "article" @default.