Pages that link to "Item:Q1719626"

The following pages link to The robust vehicle routing problem with time windows: solution by branch and price and cut (Q1719626):

Displayed 10 items.

• Robust drone selective routing in humanitarian transportation network assessment (Q2083969) ‎ (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) ‎ (← links)
• Optimizing vehicle routing via Stackelberg game framework and distributionally robust equilibrium optimization method (Q2127070) ‎ (← links)
• The vehicle routing problem with time windows and evidential service and travel times: a recourse model (Q2146039) ‎ (← links)
• Column generation-based stochastic school bell time and bus scheduling optimization (Q2189900) ‎ (← links)
• Vehicle routing with transportable resources: using carpooling and walking for on-site services (Q2315653) ‎ (← links)
• Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen (Q2664412) ‎ (← links)
• Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows (Q6065830) ‎ (← links)
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) ‎ (← links)
• Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) ‎ (← links)