Pages that link to "Item:Q958456"

The following pages link to Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456):

Displaying 7 items.

• The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
• Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
• An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← links)
• The orienteering problem with stochastic travel and service times (Q646634) (← links)
• The probabilistic orienteering problem (Q1652250) (← links)
• The probabilistic minimum dominating set problem (Q1686054) (← links)