Inverse minimum cost flow problems under the weighted Hamming distance (Q992575): 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.1016/j.ejor.2010.03.029 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016702464 / rank | |||
Normal rank | |||
Revision as of 00:57, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverse minimum cost flow problems under the weighted Hamming distance |
scientific article |
Statements
Inverse minimum cost flow problems under the weighted Hamming distance (English)
0 references
9 September 2010
0 references
network flows
0 references
inverse problem
0 references
Hamming distance
0 references
APX-hard
0 references
strongly polynomial algorithm
0 references
