CVRPSP
From MaRDI portal
Cited in
(only showing first 100 items - show all)- 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
- New benchmark instances for the capacitated vehicle routing problem
- A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
- Exact algorithms for the multi-pickup and delivery problem with time windows
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
- A unified decomposition matheuristic for assembly, production, and inventory routing
- Minimum makespan vehicle routing problem with compatibility constraints
- 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
- Exact algorithms for routing problems under vehicle capacity constraints
- The discrete time window assignment vehicle routing problem
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Two-echelon vehicle routing problems: a literature review
- Combinatorial optimization and green logistics
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations
- Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands
- 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
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- The inventory routing problem with demand moves
- VRPH
- EVE-OPT
- BoneRoute
- Concorde
- Algorithm 864
- Cliquer
- TSP software
- VRP
- libcgrpp
- PLplot
- SimCList
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- BaPCod
- VRPLIB
- CVRPSEP
- OsiSolver
- CUTGEN1
- Bison
- ORL
- Learn++
- A branch-and-cut framework for the consistent traveling salesman problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- Battery swap station location-routing problem with capacitated electric vehicles
- Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
- Multistars, partial multistars and the capacitated vehicle routing problem
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem
- The close-open mixed vehicle routing problem
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem
- The two-echelon inventory-routing problem with fleet management
- Recent advances in vehicle routing exact algorithms
- Robust multiperiod vehicle routing under customer order uncertainty
- A new ILP-based refinement heuristic for vehicle routing problems
- The joint network vehicle routing game with optional customers
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
This page was built for software: CVRPSP
