Balanced optimization problems (Q760338)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Balanced optimization problems |
scientific article; zbMATH DE number 3883950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Balanced optimization problems |
scientific article; zbMATH DE number 3883950 |
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
0.9562552
0 references
0.93792284
0 references
0.9201246
0 references
0 references
0 references
0.9006872
0 references
0.8957265
0 references
0.8901433
0 references
