Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390)
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: Modeling and solving the bi-objective minimum diameter-cost spanning tree problem |
scientific article; zbMATH DE number 6386992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Modeling and solving the bi-objective minimum diameter-cost spanning tree problem |
scientific article; zbMATH DE number 6386992 |
Statements
Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (English)
0 references
15 January 2015
0 references
spanning trees
0 references
multiflow formulation
0 references
multi-objective metaheuristics
0 references
transportation
0 references
network design
0 references
0 references
0 references
0 references
0.9574866
0 references
0.9330176
0 references
0.9070958
0 references
0 references
0.90035456
0 references
0.8934117
0 references
0.8905829
0 references
0.88946277
0 references
0 references
