Minimum deviation and balanced optimization: A unified approach (Q806674)
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: Minimum deviation and balanced optimization: A unified approach |
scientific article; zbMATH DE number 4207230
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum deviation and balanced optimization: A unified approach |
scientific article; zbMATH DE number 4207230 |
Statements
Minimum deviation and balanced optimization: A unified approach (English)
0 references
1991
0 references
In minimum deviation problems one seeks to minimize the difference between maximum and average weight in a solution. This paper introduces a general solution scheme that is also suited for balanced optimization, i.e. the problem to find a solution that has a minimal deviation between the largest and the smallest weight. The approach is analyzed with respect to computational complexity for spanning trees, paths and Steiner trees in graphs.
0 references
bottleneck criteria
0 references
minimum deviation
0 references
balanced optimization
0 references
spanning trees
0 references
paths
0 references
Steiner trees
0 references
0 references
0 references
0.8643261
0 references
0.8595509
0 references
0.8583461
0 references
0 references
0.8516099
0 references
0.8504108
0 references
0.84801036
0 references
