On inverse linear programming problems under the bottleneck-type weighted Hamming distance (Q1707916)
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: On inverse linear programming problems under the bottleneck-type weighted Hamming distance |
scientific article; zbMATH DE number 6855699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On inverse linear programming problems under the bottleneck-type weighted Hamming distance |
scientific article; zbMATH DE number 6855699 |
Statements
On inverse linear programming problems under the bottleneck-type weighted Hamming distance (English)
0 references
4 April 2018
0 references
inverse problem
0 references
Hamming distance
0 references
network flows
0 references
binary search
0 references
strongly polynomial algorithm
0 references
0 references
0 references
0 references
0.8604336977005005
0 references
0.8509747385978699
0 references
0.8471319079399109
0 references
0.8465125560760498
0 references
0.8454669117927551
0 references
