scientific article
From MaRDI portal
Publication:3751354
zbMath0611.90055MaRDI QIDQ3751354
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Vehicle routing with split deliveries, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Incorporating vehicle into the vehicle routing fleet composition problem, A branch-and-cut algorithm for vehicle routing problems, Linear temporal logic vehicle routing with applications to multi-UAV mission planning, New formulations and solution approaches for the latency location routing problem, The multi-objective generalized consistent vehicle routing problem, A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations, A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost, Models and exact solutions for a class of stochastic location-routing problems, A result on projection for the vehicle routing problem, Modeling of multi depot vehicle routing problem for petroleum products, Preprocessing to reduce vehicle capacity for routing problems, Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem, Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems, Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots, The road train optimization problem with load assignment, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, Recent advances in vehicle routing exact algorithms, Polyhedral results for a vehicle routing problem, The pickup and delivery problem with time windows, Heuristics for the lexicographic Max-ordering vehicle routing problem, A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem, Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution, The vehicle routing problem: An overview of exact and approximate algorithms, Combinatorial optimization and green logistics, Polyhedral study of the capacitated vehicle routing problem, Solving the truck and trailer routing problem based on a simulated annealing heuristic, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Exact algorithms for routing problems under vehicle capacity constraints, Combinatorial optimization and green logistics, Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on 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, Practical aspects of route planning for magazine and newspaper wholesalers, A genetic algorithm for service level based vehicle scheduling, The ALGACEA‐1 method for the capacitated vehicle routing problem, Strong cuts from compatibility relations for the dial-a-ride problem, A new subtour elimination constraint for the vehicle routing problem, Planning models for freight transportation, Stronger \(K\)-tree relaxations for the vehicle routing problem, A real delivery problem dealt with Monte Carlo techniques, Projection results for vehicle routing, Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry
