Capacity inverse minimum cost flow problems under the weighted Hamming distance (Q315493): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-015-0919-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W833648316 / rank | |||
Normal rank | |||
Revision as of 01:07, 20 March 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
