Finding non-dominated solutions for bi-objective integer transportation problem (Q4898091)
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: Finding non-dominated solutions for bi-objective integer transportation problem |
scientific article; zbMATH DE number 6119604
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding non-dominated solutions for bi-objective integer transportation problem |
scientific article; zbMATH DE number 6119604 |
Statements
29 December 2012
0 references
bi-objective programming problem
0 references
transportation model
0 references
0.812138557434082
0 references
0.7961629629135132
0 references
0.7952055335044861
0 references
0.7936487197875977
0 references
