An integer programming approach for the search of discretization orders in distance geometry problems (Q2174886): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: MIN REVORDER / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: MD-jeep / 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.1007/s11590-017-1207-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2613421882 / rank | |||
Normal rank |
Revision as of 19:15, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An integer programming approach for the search of discretization orders in distance geometry problems |
scientific article |
Statements
An integer programming approach for the search of discretization orders in distance geometry problems (English)
0 references
27 April 2020
0 references
distance geometry
0 references
integer programming
0 references
discretization order
0 references
cutting plane
0 references