Capacity inverse minimum cost flow problems under the weighted Hamming distance (Q315493): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6628843 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimum cost flow | |||
| Property / zbMATH Keywords: minimum cost flow / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
inverse problem | |||
| Property / zbMATH Keywords: inverse problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Hamming distance | |||
| Property / zbMATH Keywords: Hamming distance / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
APX-hard | |||
| Property / zbMATH Keywords: APX-hard / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
strongly polynomial algorithm | |||
| Property / zbMATH Keywords: strongly polynomial algorithm / rank | |||
Normal rank | |||
Revision as of 00:52, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Capacity inverse minimum cost flow problems under the weighted Hamming distance |
scientific article |
Statements
Capacity inverse minimum cost flow problems under the weighted Hamming distance (English)
0 references
21 September 2016
0 references
minimum cost flow
0 references
inverse problem
0 references
Hamming distance
0 references
APX-hard
0 references
strongly polynomial algorithm
0 references
