Pages that link to "Item:Q1719626"
From MaRDI portal
The following pages link to The robust vehicle routing problem with time windows: solution by branch and price and cut (Q1719626):
Displaying 23 items.
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows (Q320995) (← links)
- The robust vehicle routing problem with time windows (Q340242) (← links)
- A robust optimization approach to dispatching technicians under stochastic service times (Q375999) (← links)
- Robust optimisation approach for vehicle routing problems with uncertainty (Q1666879) (← links)
- Worst-case demand distributions in vehicle routing (Q1752215) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- A vehicle routing problem with distribution uncertainty in deadlines (Q2030574) (← links)
- 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)
- Routing optimization under uncertainty (Q2806069) (← links)
- The robust capacitated vehicle routing problem under demand uncertainty (Q2846425) (← links)
- Layered Formulation for the Robust Vehicle Routing Problem with Time Windows (Q3167629) (← links)
- Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty (Q3386790) (← links)
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)
- Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty (Q4994141) (← 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)
