A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements (Q1040407)
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: A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements |
scientific article; zbMATH DE number 5637624
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements |
scientific article; zbMATH DE number 5637624 |
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
