scientific article; zbMATH DE number 3526435
From MaRDI portal
Publication:4103312
zbMath0336.90021MaRDI QIDQ4103312
Publication date: 1976
Full work available at URL: https://eudml.org/doc/104635
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Queueing theory (aspects of probability theory) (60K25) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Related Items
A branch-and-cut algorithm for vehicle routing problems ⋮ A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times ⋮ A VNS approach to multi-location inventory redistribution with vehicle routing ⋮ An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph ⋮ Improved approximation algorithms for cumulative VRP with stochastic demands ⋮ A deterministic better-than-3/2 approximation algorithm for metric TSP ⋮ Strategies for parallel unaware cleaners ⋮ A theoretical and computational study of green vehicle routing problems ⋮ A modular algorithm for an extended vehicle scheduling problem ⋮ Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems ⋮ New inapproximability bounds for TSP ⋮ A genetic algorithm for a green vehicle routing problem ⋮ A truck and drones model for last-mile delivery: a mathematical model and heuristic approach ⋮ Modeling and algorithmic development of a staff scheduling problem ⋮ Unnamed Item ⋮ A branch and bound algorithm for the capacitated vehicle routing problem ⋮ On the integrality ratio of the subtour LP for Euclidean TSP ⋮ A priori TSP in the scenario model ⋮ Neural large neighborhood search for routing problems ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
This page was built for publication:
