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

DOI10.1007/S10878-022-00955-XMaRDI QIDQ5918581zbMATH OpenOpenAlexFDO

Authors Yuhui Sun, Wei Yu, Zhaohui Liu

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 algorithmrural postman problemstacker crane coverstacker crane problemtraveling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• Approximation algorithms for the generalized stacker crane problem
• Approximation algorithms for some min-max postmen cover problems
• Approximation algorithms for some minimum postmen cover problems
• Approximation algorithms for some minimum postmen cover problems
• Improved approximation algorithms for some min-max and minimum cycle cover problems

Cites work

• An effective and fast heuristic for the dial-a-ride problem
• Approximation algorithm for min-max cycle cover problem on a mixed graph
• Approximation Algorithms for Min-Max Cycle Cover Problems
• Approximation algorithms for multi-vehicle stacker crane problems
• Approximation algorithms for some min-max postmen cover problems
• Approximation algorithms for some minimum postmen cover problems
• Approximations for minimum and min-max vehicle routing problems
• Arc Routing
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Asymptotically Optimal Algorithms for One-to-One Pickup and Delivery Problems With Applications to Transportation Systems
• Combinatorial optimization. Theory and algorithms
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Nonpreemptive Ensemble Motion Planning on a Tree
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)

Cited in

(10)

• Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems
• Approximation algorithms for the generalized stacker crane problem
• Preemptive stacker crane problem: extending tree-based properties and construction heuristics
• Approximation algorithms for some min-max postmen cover problems
• Approximation algorithms for multi-vehicle stacker crane problems
• The stacker crane problem and the directed general routing problem
• Algorithms and Computation
• Approximation algorithms for some min-max and minimum stacker crane cover problems
• Approximation algorithms for some minimum postmen cover problems
• Approximation algorithms for the min-max mixed rural postmen cover problem and its variants

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918581)