Approximations for minimum and min-max vehicle routing problems
From MaRDI portal
Publication:5491457
DOI10.1016/j.jalgor.2005.01.007zbMath1112.68135OpenAlexW2071701840MaRDI QIDQ5491457
Esther M. Arkin, Refael Hassin, Asaf Levin
Publication date: 5 October 2006
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2005.01.007
Programming involving graphs or networks (90C35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Approximation algorithms for distance constrained vehicle routing problems, An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions, An overview of graph covering and partitioning, Approximation algorithm for distance constraint sweep coverage without predetermined base stations, Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity, Improved approximation algorithms for some min-max and minimum cycle cover problems, Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems, A min-max vehicle routing problem with split delivery and heterogeneous demand, Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems, A matheuristic for the MinMax capacitated open vehicle routing problem, Better approximability results for min-max tree/cycle/path cover problems, Approximation algorithms for distance constraint sweep coverage with base stations, Approximation algorithms for the min-max mixed rural postmen cover problem and its variants, Covering directed graphs by in-trees, Polynomial-time data reduction for weighted problems beyond additive goal functions, Approximation algorithms for the min-max mixed rural postmen cover problem and its variants, Covering Directed Graphs by In-Trees, Approximation algorithms for multi-vehicle stacker crane problems, An analysis of the extended Christofides heuristic for the \(k\)-depot TSP, Scheduling cleaning activities on trains by minimizing idle times, Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover, Unnamed Item, Approximation results for the weighted \(P_4\) partition problem, Capacitated Vehicle Routing with Non-uniform Speeds, Approximation algorithms for some min-max postmen cover problems, Min-max cover of a graph with a small number of parts, Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems, Gossip algorithms for heterogeneous multi-vehicle routing problems, New approximation algorithms for the minimum cycle cover problem, Min-max tree covers of graphs., Vehicle routing with subtours, Minimum makespan vehicle routing problem with compatibility constraints, Approximation hardness of min-max tree covers, An effective memetic algorithm for the cumulative capacitated vehicle routing problem, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, A truncated aggregate smoothing Newton method for minimax problems, New LP relaxations for minimum cycle/path/tree cover problems, Approximation results for min-max path cover problems in vehicle routing, Capacitated Vehicle Routing with Nonuniform Speeds, A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots, Approximation Algorithms for Generalized Bounded Tree Cover, Approximation algorithms for some min-max and minimum stacker crane cover problems, Approximation algorithms for some min-max and minimum stacker crane cover problems, An approximation algorithm for vehicle routing with compatibility constraints, The \(m\)-Steiner traveling salesman problem with online edge blockages, New approximation algorithms for the rooted budgeted cycle cover problem, Approximation algorithms for some minimum postmen cover problems, Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency, New approximation algorithms for the rooted budgeted cycle cover problem, Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems, Approximation results for a min-max location-routing problem, An active set smoothing method for solving unconstrained minimax problems, Continuous graph partitioning for camera network surveillance
