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