Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059): 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.dam.2017.06.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2727477347 / rank | |||
Normal rank | |||
Revision as of 23:09, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverse minimum flow problem under the weighted sum-type Hamming distance |
scientific article |
Statements
Inverse minimum flow problem under the weighted sum-type Hamming distance (English)
0 references
27 July 2017
0 references
minimum flow
0 references
minimum cut
0 references
inverse problem
0 references
Hamming distance
0 references
strongly polynomial algorithm
0 references
