Real-Time Algorithm Scheme for n-Vehicle Exploration Problem

DOI10.1007/978-3-642-02026-1_27zbMath1246.90024OpenAlexW1575978137MaRDI QIDQ3637076

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

heuristic algorithmefficient algorithm\(n\)-vehicle exploration problemreal-time algorithm scheme

Mathematics Subject Classification ID

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

Related Items (3)

A novel MILP model for \(N\)-vehicle exploration problem ⋮ Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem ⋮ A linear mixed integer programming model for \(N\)-vehicle exploration problem

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