Pages that link to "Item:Q609807"
From MaRDI portal
The following pages link to Multi-objective and multi-constrained non-additive shortest path problems (Q609807):
Displaying 11 items.
- Finding reliable shortest paths in road networks under uncertainty (Q264260) (← links)
- On an exact method for the constrained shortest path problem (Q339592) (← links)
- Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective (Q1616824) (← links)
- Multicriteria stochastic shortest path problem for electric vehicles (Q1642961) (← links)
- Non-additive shortest path in the context of traffic assignment (Q1754328) (← links)
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem (Q1761957) (← links)
- The multiple shortest path problem with path deconfliction (Q2030451) (← links)
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points (Q2664305) (← links)
- The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
- The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks (Q2943828) (← links)
- Liner Shipping Cargo Allocation with Repositioning of Empty Containers (Q6102725) (← links)