Pages that link to "Item:Q2942707"

The following pages link to A Dynamic Traveling Salesman Problem with Stochastic Arc Costs (Q2942707):

Displaying 19 items.

• Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs (Q895762) (← links)
• Solving dynamic traveling salesman problem using dynamic Gaussian process regression (Q1714778) (← links)
• Relationship between least squares Monte Carlo and approximate linear programming (Q1728294) (← links)
• A polyhedral approach to online bipartite matching (Q1801015) (← links)
• Deep Q-learning for same-day delivery with vehicles and drones (Q2076870) (← links)
• Dynamic node packing (Q2097666) (← links)
• A customized genetic algorithm for bi-objective routing in a dynamic network (Q2242262) (← links)
• A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
• Dynamic traveling salesman problem with stochastic release dates (Q2327624) (← links)
• The covering Canadian traveller problem (Q2440168) (← links)
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes (Q2817835) (← links)
• Theory and application of reciprocal transformation of “path problem” and “time float problem” (Q2969956) (← links)
• A Polyhedral Approach to Online Bipartite Matching (Q3186510) (← links)
• (Q3385380) (← links)
• (Q4999375) (← links)
• Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
• A progressive hedging method for the multi-path travelling salesman problem with stochastic travel times (Q5382709) (← links)
• New policies for the dynamic traveling salesman problem (Q5426977) (← links)
• A bi-criteria moving-target travelling salesman problem under uncertainty (Q6167752) (← links)