On finding the K best cuts in a network (Q792224): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An O(K.n**4) algorithm for finding the K best cuts in a network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3683848 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Network Flow Problems Solved with Pseudo-Boolean Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4130999 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost / rank | |||
Normal rank | |||
Revision as of 11:33, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finding the K best cuts in a network |
scientific article |
Statements
On finding the K best cuts in a network (English)
0 references
1984
0 references
A counterexample to an algorithm of the first author [ibid. 1, 186-189 (1982; Zbl 0505.90023)] for finding K best cuts in a network is given.
0 references
best cuts
0 references
flow algorithm
0 references
ranking of solutions
0 references
counterexample
0 references
