Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route

DOI10.1134/S0005117912020105zbMath1307.90021OpenAlexW2169381957MaRDI QIDQ2261716

A. V. Shakhshneider, E. Kh. Gimadi

Publication date: 13 March 2015

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117912020105

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

Cites Work

• Probabilistic analysis of a capacitated vehicle routing problem. II
• On the complexity of the \(k\)-customer vehicle routing problem
• The Truck Dispatching Problem
• Probabilistic analysis for a multiple depot vehicle routing problem
• Bounds and Heuristics for Capacitated Routing Problems
• Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
• Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route