A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
From MaRDI portal
Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(36)- Hybridizing exact methods and metaheuristics: a taxonomy
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- A branch-and-cut algorithm for the time window assignment vehicle routing problem
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- Reachability cuts for the vehicle routing problem with time windows
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- Formulations and exact algorithms for the vehicle routing problem with time windows
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
- Lagrangian duality applied to the vehicle routing problem with time windows
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
- Routing and scheduling field service operation by P-graph
- 2-path cuts for the vehicle routing problem with time windows
- Solution of a min-max vehicle routing problem
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
- Lifted and local reachability cuts for the vehicle routing problem with time windows
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
- Vehicle Routing with Time Windows
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- A GRASP for the Vehicle Routing Problem with Time Windows
- AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS
- New lower bounds on the number of vehicles for the vehicle routing problem with time windows
- A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location
- A multi‐vehicle covering tour problem with speed optimization
- A tutorial on column generation and branch-and-price for vehicle routing problems
- A branch-and-cut algorithm for the pallet-loading vehicle routing problem considering load balance of semi-trailer trucks
- Vehicle routing problem with time windows -- new valid inequalities from polar duality
- Arcs-states models for the vehicle routing problem with time windows and related problems
- A goal programming approach to vehicle routing problems with soft time windows
- A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement
This page was built for publication: A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4408696)
