The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm (Q2496036)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5037982
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm |
scientific article; zbMATH DE number 5037982 |
Statements
The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm (English)
0 references
30 June 2006
0 references
minimum cost flow problem
0 references
multiobjective programming
0 references
efficient solution
0 references
0.8571252822875977
0 references
0.831201434135437
0 references
0.8006592392921448
0 references
0.7809234261512756
0 references
0.7792974710464478
0 references
