A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements (Q1040407): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10559-009-9110-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10559-009-9110-8 / rank | |||
Normal rank | |||
Latest revision as of 14:28, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements |
scientific article |
Statements
A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements (English)
0 references
24 November 2009
0 references
multicriterion optimization
0 references
discrete optimization
0 references
combinatorial sets
0 references
polyarrangements
0 references
Pareto-optimal solutions
0 references
weakly and strongly efficient solutions
0 references
0 references
