An analytic symmetrization of max flow-min cut (Q1356775): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Manfred W. Padberg / rank | |||
Property / author | |||
Property / author: Manfred W. Padberg / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The perfectly matchable subgraph polytope of a bipartite graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The perfectly matchable subgraph polytope of an arbitrary graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3844775 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximal Flow Through a Network / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5514188 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5620998 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4082546 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048571 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the width—length inequality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear optimization and extensions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An analytical comparison of different formulations of the travelling salesman problem / rank | |||
Normal rank |
Revision as of 14:13, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An analytic symmetrization of max flow-min cut |
scientific article |
Statements
An analytic symmetrization of max flow-min cut (English)
0 references
10 June 1997
0 references
maximum capacitated \((s,t)\)-flow problem
0 references
minimum weighted \((s,t)\)-cut problem
0 references
directed network
0 references
max flow-min cut theorem for undirected graphs
0 references