Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: heapsort / rank | |||
Normal rank | |||
Revision as of 03:09, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving combinatorial problems with combined min-max-min-sum objective and applications |
scientific article |
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
