Real-Time Algorithm Scheme for n-Vehicle Exploration Problem

DOI10.1007/978-3-642-02026-1_27MaRDI QIDQ3637076zbMATH OpenOpenAlexFDO

Authors Xiaoya Li, Jin-Chuan Cui

Publication date 7 July 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_27

zbMATH Keywords

\(n\)-vehicle exploration problemefficient algorithmheuristic algorithmreal-time algorithm scheme

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Deterministic network models in operations research (90B10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Efficient algorithm for a kind of exploration problem with N vehicles
• A kind of -approximation algorithm for the exploration problem with N vehicles
• A kind of rollout algorithm for N vehicles exploration problem
• Multitask n-vehicle exploration problem: complexity and algorithm
• A linear mixed integer programming model for N-vehicle exploration problem

Cited in

(7)

• Research on the efficient computation mechanism -- in the case of N-vehicle exploration problem
• A novel MILP model for \(N\)-vehicle exploration problem
• A linear mixed integer programming model for N-vehicle exploration problem
• A kind of rollout algorithm for N vehicles exploration problem
• A kind of -approximation algorithm for the exploration problem with N vehicles
• Efficient algorithm for a kind of exploration problem with N vehicles
• scientific article; zbMATH DE number 4060773 (Why is no real title available?)

This page was built for publication: Real-Time Algorithm Scheme for n-Vehicle Exploration Problem

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