CVRPSP

swMATH13447MaRDI QIDQ25361FDOQ25361

Author name not available (Why is that?)

Official website: http://www.hha.dk/~lys/CVRPSEP.htm

Described by source

• A new branch-and-cut algorithm for the capacitated vehicle routing problem

Cited In (only showing first 100 items - show all)

• Formulations and valid inequalities for the heterogeneous vehicle routing problem
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Reachability cuts for the vehicle routing problem with time windows
• 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
• New families of valid inequalities for the two-echelon vehicle routing problem
• Routing problems with loading constraints
• Heuristic and exact algorithms for the multi-pile vehicle 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
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• The production routing problem: a review of formulations and solution algorithms
• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• A general heuristic for vehicle routing problems
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• Efficient elementary and restricted non-elementary route pricing
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
• Exact algorithms for routing problems under vehicle capacity constraints
• Combinatorial optimization and green logistics
• The discrete time window assignment vehicle routing problem
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands
• A branch-and-cut framework for the consistent traveling salesman problem
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Multistars, partial multistars and the capacitated vehicle routing problem
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
• Battery swap station location-routing problem with capacitated electric vehicles
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
• Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem
• EVE-OPT
• BoneRoute
• Concorde
• Algorithm 864
• Cliquer
• TSP software
• VRP
• libcgrpp
• PLplot
• SimCList
• BaPCod
• VRPLIB
• CVRPSEP
• OsiSolver
• CUTGEN1
• Bison
• Recent advances in vehicle routing exact algorithms
• A new ILP-based refinement heuristic for vehicle routing problems
• ORL
• Combinatorial optimization and green logistics
• Title not available (Why is that?)
• A branch-and-cut algorithm for the nonpreemptive swapping problem
• Learn++
• An exact algorithm for the period routing problem
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
• A computational comparison of flow formulations for the capacitated location-routing problem
• Cut-first branch-and-price-second for the capacitated arc-routing problem
• A library of local search heuristics for the vehicle routing problem
• An exact solution framework for a broad class of vehicle routing problems
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
• Managing platelet supply through improved routing of blood collection vehicles
• Rich routing problems arising in supply chain management
• An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• A branch-and-cut algorithm for the time window assignment vehicle routing problem
• Improved branch-cut-and-price for capacitated vehicle routing
• A new mixed integer linear model for a rich vehicle routing problem with docking constraints
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star 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 algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• The vehicle routing problem with time windows and temporal dependencies
• Exact algorithms for the clustered vehicle routing problem
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
• An integer linear programming local search for capacitated vehicle routing problems
• Modeling and solving profitable location and distribution problems
• Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
• New route relaxation and pricing strategies for the vehicle routing problem
• 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
• 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
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
• Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
• crossoverOX
• The coastal seaspace patrol sector design and allocation problem
• A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
• Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
• Modeling and optimization of vehicle routing and arc routing problems
• Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products

This page was built for software: CVRPSP