A preference-based approach to spanning trees and shortest paths problems (Q704097)
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 preference-based approach to spanning trees and shortest paths problems |
scientific article; zbMATH DE number 2127041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A preference-based approach to spanning trees and shortest paths problems |
scientific article; zbMATH DE number 2127041 |
Statements
A preference-based approach to spanning trees and shortest paths problems (English)
0 references
12 January 2005
0 references
Preference modelling
0 references
Combinatorial optimization
0 references
Preference-based search
0 references
Multiobjective optimization
0 references
0 references
0 references
0 references
0 references
0.8291982412338257
0 references
0.7641518115997314
0 references
0.7511294484138489
0 references
0.7465142011642456
0 references
0.7366783022880554
0 references
