Balanced optimization problems (Q760338)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Balanced optimization problems |
scientific article |
Statements
Balanced optimization problems (English)
0 references
1984
0 references
So-called balanced optimization problems are combinatorial problems in which a feasible subset of a finite set must be found, such that the difference between the maximal and the minimal elements is as small as possible. The algorithms for these problems, given in the paper, are polynomial if there are polynomial procedures for finding the feasible subsets.
0 references
combinatorial optimization
0 references
computational complexity
0 references
assignment problem
0 references
matching problem
0 references
polynomial algorithm
0 references
balanced optimization
0 references
feasible subset
0 references
