Pages that link to "Item:Q296774"
From MaRDI portal
The following pages link to The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774):
Displaying 9 items.
- An approach to the asymmetric multi-depot capacitated arc routing problem (Q319291) (← links)
- The constrained shortest path problem with stochastic correlated link travel times (Q323479) (← links)
- Task assignment with start time-dependent processing times for personnel at check-in counters (Q1617296) (← links)
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem (Q1634089) (← links)
- Branch-and-price approaches for the multiperiod technician routing and scheduling problem (Q1752769) (← links)
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
- Lagrangian relaxation for the multiple constrained robust shortest path problem (Q2298370) (← links)
- PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries (Q2656784) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)
