Exact algorithms for routing problems under vehicle capacity constraints
From MaRDI portal
(Redirected from Publication:970191)
Recommendations
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 4143778 (Why is no real title available?)
- scientific article; zbMATH DE number 3989085 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1749222 (Why is no real title available?)
- scientific article; zbMATH DE number 1749223 (Why is no real title available?)
- scientific article; zbMATH DE number 1749224 (Why is no real title available?)
- scientific article; zbMATH DE number 1749225 (Why is no real title available?)
- scientific article; zbMATH DE number 3892967 (Why is no real title available?)
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- A column generation approach to the heterogeneous fleet vehicle routing problem
- A fast algorithm for the maximum clique problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A result on projection for the vehicle routing problem
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A unified exact method for solving different classes of vehicle routing problems
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Edmonds polytopes and weakly hamiltonian graphs
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Implementing vehicle routing algorithms
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Multistars, partial multistars and the capacitated vehicle routing problem
- On the capacitated vehicle routing problem
- On the symmetric travelling salesman problem I: Inequalities
- Optimal Routing under Capacity and Distance Restrictions
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Polyhedral study of the capacitated vehicle routing problem
- Projection results for vehicle routing
- Recent advances in vehicle routing exact algorithms
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Routing a heterogeneous fleet of vehicles
- Separating capacity constraints in the CVRP using tabu search
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- The traveling salesman problem. A computational study.
- The truck dispatching problem
- Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
Cited in
(44)- A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery
- The family capacitated vehicle routing problem
- Improved load balancing and resource utilization for the skill vehicle routing problem
- The consistent vehicle routing problem with heterogeneous fleet
- A multi-stage algorithm for a capacitated vehicle routing problem with time constraints
- Exact solutions of some optimization problems of transport logistics
- A genetic algorithm for a green vehicle routing problem
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- scientific article; zbMATH DE number 6545534 (Why is no real title available?)
- scientific article; zbMATH DE number 5667551 (Why is no real title available?)
- An approximation algorithm for vehicle routing with compatibility constraints
- The pyramidal capacitated vehicle routing problem
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- Multi-objective vehicle routing and loading with time window constraints: a real-life application
- Optimal capacitated ring trees
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- The demand weighted vehicle routing problem
- Vehicle routing with full loads
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- Approximation Algorithms for Conflict-Free Vehicle Routing
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
- Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- Approximating the chance-constrained capacitated vehicle routing problem with robust optimization
- Capacitated vehicle routing with nonuniform speeds
- scientific article; zbMATH DE number 3989085 (Why is no real title available?)
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- Thirty years of heterogeneous vehicle routing
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
- Computational Science – ICCS 2005
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
- A PTAS for bounded-capacity vehicle routing in planar graphs
- Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization
- Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications
- Preprocessing to reduce vehicle capacity for routing problems
- Combined route capacity and route length models for unit demand vehicle routing problems
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- Special issue on vehicle routing and scheduling: recent trends and advances
This page was built for publication: Exact algorithms for routing problems under vehicle capacity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970191)