An algorithm for computing maximum solution bases (Q2641220): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q290243 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Marius Zimand / rank | |||
Normal rank |
Revision as of 16:54, 12 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for computing maximum solution bases |
scientific article |
Statements
An algorithm for computing maximum solution bases (English)
0 references
1990
0 references
The paper is concerned with families of problems defined on a common solution space, each problem having its own subset of feasible solutions. Each problem is associated with a cost and the value of a problem is the minimum cost of a feasible solution. A key concept in this approach is the maximum solution basis, which, roughly speaking is a subset of problems with the following property: finding the values of the problems in the maximum solution basis allows to compute easily the value of any of the problems. An algorithm for generating a maximum solution basis is described. The possibilities of applying this algorithm to the multiterminal cut problem are discussed.
0 references
maximum solution basis
0 references
multiterminal cut problem
0 references