Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem

DOI10.1007/s10255-018-0774-6zbMath1395.68157OpenAlexW2887343096MaRDI QIDQ1782048

Fang Yu, Jin-Chuan Cui

Publication date: 18 September 2018

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-018-0774-6

zbMATH Keywords

clustercomputational complexity\(N\)-vehicle exploration problemefficient computation mechanism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Multiple jeeps problem with container restriction ⋮ Unnamed Item ⋮ The efficient computation of aircraft range problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit
• A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
• Smoothed analysis of algorithms
• Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
• On the Structure of Polynomial Time Reducibility
• Complexity of computations
• Computational Complexity
• On the Computational Complexity of Algorithms
• An Algebraic Theory of Complexity for Discrete Optimization
• The Jeep Problem

This page was built for publication: Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem