Pages that link to "Item:Q970191"
From MaRDI portal
The following pages link to Exact algorithms for routing problems under vehicle capacity constraints (Q970191):
Displaying 43 items.
- Optimal capacitated ring trees (Q286687) (← links)
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints (Q336326) (← links)
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem (Q336737) (← links)
- Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
- Special issue on vehicle routing and scheduling: recent trends and advances (Q375973) (← links)
- Improved load balancing and resource utilization for the skill vehicle routing problem (Q395849) (← links)
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW (Q439557) (← links)
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches (Q512864) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- Vehicle routing with full loads (Q1099072) (← links)
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
- A genetic algorithm for a green vehicle routing problem (Q1742204) (← links)
- The demand weighted vehicle routing problem (Q1754023) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
- A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery (Q1983673) (← links)
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213) (← links)
- Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem (Q2023966) (← links)
- Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
- Multi-objective vehicle routing and loading with time window constraints: a real-life application (Q2196102) (← links)
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
- The pyramidal capacitated vehicle routing problem (Q2270294) (← links)
- A multi-stage algorithm for a capacitated vehicle routing problem with time constraints (Q2283860) (← links)
- A PTAS for bounded-capacity vehicle routing in planar graphs (Q2285086) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- The consistent vehicle routing problem with heterogeneous fleet (Q2669772) (← links)
- (Q2787279) (← links)
- Capacitated vehicle routing with nonuniform speeds (Q2800377) (← links)
- Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization (Q2988479) (← links)
- Approximation Algorithms for Conflict-Free Vehicle Routing (Q3092267) (← links)
- (Q3404305) (← links)
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
- (Q3751354) (← links)
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems (Q4286472) (← links)
- Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications (Q4974761) (← links)
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation (Q5321991) (← links)
- Computational Science – ICCS 2005 (Q5709516) (← links)
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet (Q5963103) (← links)
- Approximating the chance-constrained capacitated vehicle routing problem with robust optimization (Q6054019) (← links)
- Preprocessing to reduce vehicle capacity for routing problems (Q6097441) (← links)
- The family capacitated vehicle routing problem (Q6556080) (← links)