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

DOI10.1007/s10878-022-00955-xOpenAlexW4310276329MaRDI QIDQ5918581

Wei Yu, Zhaohui Liu, Yuhui Sun

Publication date: 29 November 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00955-x

zbMATH Keywords

approximation algorithmtraveling salesman problemrural postman problemstacker crane problemstacker crane cover

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

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
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Approximation algorithms for multi-vehicle stacker crane problems
• 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
• Combinatorial optimization. Theory and algorithms
• Approximation algorithms for some minimum postmen cover problems

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