Capacity inverse minimum cost flow problems under the weighted Hamming distance (Q315493): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11590-015-0919-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-015-0919-Y / rank | |||
Normal rank | |||
Revision as of 16:18, 8 December 2024
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
0 references
0 references
