A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117)
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 method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs |
scientific article; zbMATH DE number 5137638
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs |
scientific article; zbMATH DE number 5137638 |
Statements
A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (English)
0 references
27 March 2007
0 references
integer programming
0 references
multiple objective programming
0 references
parametric programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.93737245
0 references
0.90465325
0 references
0.90085256
0 references
0.89572847
0 references
0.8886556
0 references
0.8830062
0 references
0.8827668
0 references
0.8772152
0 references
0.8761022
0 references
