Inverse min-max spanning \(r\)-arborescence problem under the weighted sum-type Hamming distance (Q2818313)
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: Inverse min-max spanning \(r\)-arborescence problem under the weighted sum-type Hamming distance |
scientific article; zbMATH DE number 6624803
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverse min-max spanning \(r\)-arborescence problem under the weighted sum-type Hamming distance |
scientific article; zbMATH DE number 6624803 |
Statements
7 September 2016
0 references
combinatorial optimization
0 references
inverse optimization problem
0 references
min-max spanning \(r\)-arborescence
0 references
Hamming distance
0 references
complexity theory
0 references
Inverse min-max spanning \(r\)-arborescence problem under the weighted sum-type Hamming distance (English)
0 references
