CVRPSP
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- VRPH
- Multistars, partial multistars and the capacitated vehicle routing problem
- EVE-OPT
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
- Managing platelet supply through improved routing of blood collection vehicles
- An exact algorithm for a vehicle-and-driver scheduling problem
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
- A branch-and-cut algorithm for the time window assignment vehicle routing problem
- BoneRoute
- TSP software
- Concorde
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- Cliquer
- Algorithm 864
- VRP
- A genetic algorithm for a green vehicle routing problem
- BPPLIB: a library for bin packing and cutting stock problems
- The separation problem of rounded capacity inequalities: some polynomial cases
- On the complexity of the separation problem for rounded capacity inequalities
- Route relaxations on GPU for vehicle routing problems
- The value of integrating loading and routing
- New benchmark instances for the capacitated vehicle routing problem
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- A computational comparison of flow formulations for the capacitated location-routing problem
- libcgrpp
- The close-open mixed vehicle routing problem
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- PLplot
- SimCList
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
- An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
- Minimum makespan vehicle routing problem with compatibility constraints
- The two-echelon production-routing problem
- A personalized walking bus service requiring optimized route decisions: a real case
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- Two-echelon vehicle routing problems: a literature review
- Heuristic optimization for multi-depot vehicle routing problem in ATM network model
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations
- Exact algorithms for the multi-pickup and delivery problem with time windows
- BaPCod
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- A generic exact solver for vehicle routing and related problems
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- VRPLIB
- The inventory routing problem with demand moves
- A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies
- Rich routing problems arising in supply chain management
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- The pyramidal capacitated vehicle routing problem
- A branch-and-cut algorithm for an assembly routing problem
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
- A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- A compact transformation of arc routing problems into node routing problems
- Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach
- CVRPSEP
- A unified exact method for solving different classes of vehicle routing problems
- Improved branch-cut-and-price for capacitated vehicle routing
- A new mixed integer linear model for a rich vehicle routing problem with docking constraints
- Reachability cuts for the vehicle routing problem with time windows
- OsiSolver
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- An optimization algorithm for the inventory routing problem with continuous moves
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- Decomposition and dynamic cut generation in integer linear programming
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
- Facets and valid inequalities for the time-dependent travelling salesman problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- Projection results for vehicle routing
- A new ILP-based refinement heuristic for vehicle routing problems
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem
- The two-echelon inventory-routing problem with fleet management
- The joint network vehicle routing game with optional customers
- An improved formulation for the inventory routing problem with time-varying demands
- CUTGEN1
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem
- The robust capacitated vehicle routing problem under demand uncertainty
- New route relaxation and pricing strategies for the vehicle routing problem
- New families of valid inequalities for the two-echelon vehicle routing problem
- A branch-and-cut algorithm for the preemptive swapping problem
- Bison
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Efficient elementary and restricted non-elementary route pricing
- An exact algorithm for the period routing problem
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
- Cash flow optimization in ATM network model
- Cuts over extended formulations by flow discretization
- The vehicle routing problem with time windows and temporal dependencies
This page was built for software: CVRPSP
