Optimal Solutions for the Closest-String Problem via Integer Programming (Q2890443): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Panos M. Pardalos / rank | |||
| Property / author | |||
| Property / author: Panos M. Pardalos / 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.1287/ijoc.1040.0090 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2144355282 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:49, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal Solutions for the Closest-String Problem via Integer Programming |
scientific article |
Statements
Optimal Solutions for the Closest-String Problem via Integer Programming (English)
0 references
8 June 2012
0 references
closest-string problem
0 references
computational biology
0 references
mathematical programming
0 references
branch-and-bound algorithms
0 references
