The following pages link to (Q4955264):
Displaying 50 items.
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
- A heuristic algorithm for a supply chain's production-distribution planning (Q337603) (← links)
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- The school bus problem on trees (Q378249) (← links)
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility (Q490371) (← links)
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- Flow-based integer linear programs to solve the weekly log-truck scheduling problem (Q748554) (← links)
- An optimization approach for communal home meal delivery service: A case study (Q837090) (← links)
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees (Q860395) (← links)
- Finished-vehicle transporter routing problem solved by loading pattern discovery (Q893051) (← links)
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) (← links)
- Synchronized routing of seasonal products through a production/distribution network (Q926350) (← links)
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem (Q953302) (← links)
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
- Heuristic solutions to multi-depot location-routing problems (Q1603335) (← links)
- Truck routing and scheduling (Q1642792) (← links)
- Optimization problems with flexible objectives: a general modeling approach and applications (Q1698885) (← links)
- The selective traveling salesman problem with emission allocation rules (Q1703461) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- Selective and periodic inventory routing problem for waste vegetable oil collection (Q1758051) (← links)
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP (Q1761144) (← links)
- Solving the vehicle routing problem with adaptive memory programming methodology (Q1772865) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- Linear formulations for the vehicle routing problem with synchronization constraints (Q1792416) (← links)
- A simple and effective evolutionary algorithm for the vehicle routing problem (Q1879785) (← links)
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem (Q2012880) (← links)
- Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
- Deep infeasibility exploration method for vehicle routing problems (Q2163783) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
- Reoptimization framework and policy analysis for maritime inventory routing under uncertainty (Q2315088) (← links)
- Dynamic vehicle routing using genetic algorithms (Q2383962) (← links)
- An exponential (matching based) neighborhood for the vehicle routing problem (Q2427439) (← links)
- Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem (Q2508207) (← links)
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows (Q2571182) (← links)
- Modelling the mobile target covering problem using flying drones (Q2629909) (← links)
- Selfish Transportation Games (Q2971133) (← links)
- Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845) (← links)
- What you should know about the vehicle routing problem (Q3499286) (← links)
- From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods (Q3564370) (← links)
- The school bus routing and scheduling problem with transfers (Q4642460) (← links)
- A New Model Approach on Cost-Optimal Charging Infrastructure for Electric-Drive Vehicle Fleets (Q5232820) (← links)
- Combinatorial optimization and green logistics (Q5925286) (← links)
- Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
- The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands (Q6161273) (← links)
