A new saling algorithm for the maximum mean cut problem (Q1317477): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01240735 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090219729 / rank | |||
Normal rank | |||
Latest revision as of 09:45, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new saling algorithm for the maximum mean cut problem |
scientific article |
Statements
A new saling algorithm for the maximum mean cut problem (English)
0 references
17 April 1994
0 references
maximum mean
0 references
scaling algorithm
0 references
circulation feasibility
0 references
minimum-cost circulation
0 references
binary search
0 references
