The minimum distance superset problem: formulations and algorithms (Q1756748)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6996781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum distance superset problem: formulations and algorithms |
scientific article; zbMATH DE number 6996781 |
Statements
The minimum distance superset problem: formulations and algorithms (English)
0 references
21 December 2018
0 references
partial digest problem
0 references
minimum distance superset
0 references
turnpike problem
0 references
combinatorial optimization
0 references
integer programming
0 references
0 references
0 references
0.7300640344619751
0 references
0.7079020738601685
0 references
0.6887048482894897
0 references
