Combinatorial algorithms for inverse network flow problems (Q4798190): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A characterization of the minimum cycle mean in a digraph / rank | |||
Normal rank | |||
Revision as of 14:04, 5 June 2024
scientific article; zbMATH DE number 1884750
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial algorithms for inverse network flow problems |
scientific article; zbMATH DE number 1884750 |
Statements
Combinatorial algorithms for inverse network flow problems (English)
0 references
19 March 2003
0 references
inverse optimization
0 references
maximum-flow problem
0 references
minimum-cut problem
0 references
minimum-cost flow problem minimum mean-cycle problem
0 references
minimax problems
0 references
