Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4118171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving combinatorial problems with combined min-max-min-sum objective and applications |
scientific article; zbMATH DE number 4118171 |
Statements
Solving combinatorial problems with combined min-max-min-sum objective and applications (English)
0 references
1989
0 references
bottleneck cost function
0 references
linear cost function
0 references
matchings
0 references
matroid intersection
0 references
weighted edge coloring
0 references
bicriterion analysis
0 references
0 references
0 references
0.8320813775062561
0 references
0.8183887600898743
0 references
0.8117651343345642
0 references
0.8115996718406677
0 references
0.798505425453186
0 references
