Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems (Q5084653)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems |
scientific article; zbMATH DE number 7549379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems |
scientific article; zbMATH DE number 7549379 |
Statements
Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems (English)
0 references
28 June 2022
0 references
distance geometry
0 references
discretization order
0 references
integer programming
0 references
constraint programming
0 references
decomposition algorithms
0 references
0.7297745943069458
0 references
0.6979089379310608
0 references
0.6913458704948425
0 references
0.6828230023384094
0 references
0.6823645830154419
0 references
