Approximation algorithms for some min-max and minimum stacker crane cover problems

DOI10.1007/978-3-030-92681-6_32OpenAlexW4206418804MaRDI QIDQ5918727

Wei Yu, Zhaohui Liu, Yuhui Sun

Publication date: 29 June 2022

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_32

zbMATH Keywords

approximation algorithmtraveling salesman problemrural postman problemstacker crane problemstacker crane cover

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Approximation algorithms for the min-max mixed rural postmen cover problem and its variants

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for some min-max postmen cover problems
• An effective and fast heuristic for the dial-a-ride problem
• Approximation Algorithms for Min-Max Cycle Cover Problems
• Nonpreemptive Ensemble Motion Planning on a Tree
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Arc Routing
• Asymptotically Optimal Algorithms for One-to-One Pickup and Delivery Problems With Applications to Transportation Systems
• Approximations for minimum and min-max vehicle routing problems
• Approximation algorithms for some minimum postmen cover problems
• Solving the large-scale min-max \(k\)-rural postman problem for snow plowing

This page was built for publication: Approximation algorithms for some min-max and minimum stacker crane cover problems