scientific article; zbMATH DE number 3989085
From MaRDI portal
Publication:3751354
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)
Recommendations
- scientific article; zbMATH DE number 3914114
- Exact algorithms for routing problems under vehicle capacity constraints
- scientific article; zbMATH DE number 1452992
- Exact algorithms for the chance-constrained vehicle routing problem
- Exact algorithms for the chance-constrained vehicle routing problem
- Approximation algorithms for a vehicle routing problem
- The vehicle routing problem: An overview of exact and approximate algorithms
- Recent advances in vehicle routing exact algorithms
- An exact solution framework for a broad class of vehicle routing problems
- Exact algorithms for the clustered vehicle routing problem
Cited in
(52)- Models and exact solutions for a class of stochastic location-routing problems
- A result on projection for the vehicle routing problem
- Polyhedral results for a vehicle routing problem
- The pickup and delivery problem with time windows
- The vehicle routing problem: An overview of exact and approximate algorithms
- Practical aspects of route planning for magazine and newspaper wholesalers
- A genetic algorithm for service level based vehicle scheduling
- A new subtour elimination constraint for the vehicle routing problem
- Planning models for freight transportation
- Vehicle routing with split deliveries
- A branch-and-cut algorithm for vehicle routing problems
- A real delivery problem dealt with Monte Carlo techniques
- A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost
- Modeling of multi depot vehicle routing problem for petroleum products
- 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
- Stronger K-tree relaxations for the vehicle routing problem
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
- Strong cuts from compatibility relations for the dial-a-ride problem
- New formulations and solution approaches for the latency location routing problem
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- A new heuristic for the fleet size and mix vehicle routing problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Incorporating vehicle into the vehicle routing fleet composition problem
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
- Heuristics for the lexicographic Max-ordering vehicle routing problem
- Projection results for vehicle routing
- Linear temporal logic vehicle routing with applications to multi-UAV mission planning
- Vehicle Routing Algorithms for Radially Escaping Targets
- Approximation Algorithms for Conflict-Free Vehicle Routing
- The multi-objective generalized consistent vehicle routing problem
- The ALGACEA‐1 method for the capacitated vehicle routing problem
- Two exact algorithms for the vehicle routing problem on trees
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
- Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications
- Combinatorial optimization and green logistics
- Combinatorial optimization and green logistics
- Preprocessing to reduce vehicle capacity for routing problems
- The road train optimization problem with load assignment
- An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
- Polyhedral study of the capacitated vehicle routing problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Integrated packing and routing: a model and its solutions
- Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry
- Recent advances in vehicle routing exact algorithms
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Solving the truck and trailer routing problem based on a simulated annealing heuristic
- Exact algorithms for routing problems under vehicle capacity constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751354)
