An improved integer linear programming formulation for the closest 0-1 string problem (Q1652195)
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: An improved integer linear programming formulation for the closest 0-1 string problem |
scientific article; zbMATH DE number 6901361
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved integer linear programming formulation for the closest 0-1 string problem |
scientific article; zbMATH DE number 6901361 |
Statements
An improved integer linear programming formulation for the closest 0-1 string problem (English)
0 references
11 July 2018
0 references
closest string problem
0 references
branch-and-cut
0 references
continuous relaxation
0 references
