CVRPSP
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Combinatorial optimization and green logistics
- scientific article; zbMATH DE number 5247432 (Why is no real title available?)
- A computational comparison of flow formulations for the capacitated location-routing problem
- Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem
- An exact algorithm for the period routing problem
- A library of local search heuristics for the vehicle routing problem
- A branch-and-cut algorithm for the nonpreemptive swapping problem
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- An exact solution framework for a broad class of vehicle routing problems
- Robust data-driven vehicle routing with time windows
- Cut-first branch-and-price-second for the capacitated arc-routing problem
- crossoverOX
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- A branch-and-cut algorithm for an assembly routing problem
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
- Managing platelet supply through improved routing of blood collection vehicles
- Addressing orientation symmetry in the time window assignment vehicle routing problem
- A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
- Rich routing problems arising in supply chain management
- The distributionally robust chance-constrained vehicle routing problem
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- A branch-and-cut algorithm for the time window assignment vehicle routing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Solving the capacitated location-routing problem. Abstract of Thesis
- Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- A new mixed integer linear model for a rich vehicle routing problem with docking constraints
- Improved branch-cut-and-price for capacitated vehicle routing
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- Cvrplib
- Combined route capacity and route length models for unit demand vehicle routing problems
- The vehicle routing problem with time windows and temporal dependencies
- Enhanced mixed integer programming techniques and routing problems
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- Exact algorithms for the clustered vehicle routing problem
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- Modeling and solving profitable location and distribution problems
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
- An integer linear programming local search for capacitated vehicle routing problems
- New route relaxation and pricing strategies for the vehicle routing problem
- Heuristic optimization for multi-depot vehicle routing problem in ATM network model
- A branch-and-cut algorithm for the preemptive swapping problem
- A unified exact method for solving different classes of vehicle routing problems
- BPPLIB: a library for bin packing and cutting stock problems
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- VRPSolver
- Route relaxations on GPU for vehicle routing problems
- Decomposition and dynamic cut generation in integer linear programming
- The two-echelon production-routing problem
- Cuts over extended formulations by flow discretization
- Projection results for vehicle routing
- Solving capacitated arc routing problems using a transformation to the CVRP
- A compact transformation of arc routing problems into node routing problems
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
- The coastal seaspace patrol sector design and allocation problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Reachability cuts for the vehicle routing problem with time windows
- A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies
- An optimization algorithm for the inventory routing problem with continuous moves
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
- Routing problems with loading constraints
- New families of valid inequalities for the two-echelon vehicle routing problem
- A genetic algorithm for a green vehicle routing problem
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- The value of integrating loading and routing
- Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
- Modeling and optimization of vehicle routing and arc routing problems
- 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
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- The production routing problem: a review of formulations and solution algorithms
- Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty
- Cash flow optimization in ATM network model
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- The pyramidal capacitated vehicle routing problem
- A general heuristic for vehicle routing problems
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
- A generic exact solver for vehicle routing and related problems
- An improved formulation for the inventory routing problem with time-varying demands
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- The robust capacitated vehicle routing problem under demand uncertainty
- Facets and valid inequalities for the time-dependent travelling salesman problem
- On the complexity of the separation problem for rounded capacity inequalities
- The separation problem of rounded capacity inequalities: some polynomial cases
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
- Efficient elementary and restricted non-elementary route pricing
- Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft
- Improved branch-cut-and-price for capacitated vehicle routing
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
This page was built for software: CVRPSP
