Pages that link to "Item:Q2327649"
From MaRDI portal
The following pages link to Shortest paths with ordinal weights (Q2327649):
Displaying 11 items.
- Shortest paths in networks with vector weights (Q795755) (← links)
- On BF-orderable graphs (Q1084116) (← links)
- Bottleneck shortest paths on a partially ordered scale (Q1416100) (← links)
- Shortest path problems with partial information: Models and algorithms for detecting dominance (Q1969885) (← links)
- The binary knapsack problem with qualitative levels (Q2029032) (← links)
- Priority-Consistent Graphs (Q3439392) (← links)
- (Q3626683) (← links)
- Shortest Paths with Bundles and Non-additive Weights Is Hard (Q4924655) (← links)
- Multi-objective matroid optimization with ordinal weights (Q6046136) (← links)
- Ordinal optimization through multi-objective reformulation (Q6096566) (← links)
- On modelling and solving the shortest path problem with evidential weights (Q6160930) (← links)