Multitask \(n\)-vehicle exploration problem: complexity and algorithm

DOI10.1007/s11424-012-9324-0zbMath1282.90078OpenAlexW1989000650MaRDI QIDQ394382

Yang-yang Xu, Jin-Chuan Cui

Publication date: 27 January 2014

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-012-9324-0

zbMATH Keywords

NP-hardheuristic algorithmstrongly NP-hardmultitask \(n\)-vehicle exploration problem (MTNVEP)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Modeling and solving a multi-period inventory fulfilling and routing problem for hazardous materials ⋮ A novel MILP model for \(N\)-vehicle exploration problem

Cites Work

• An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
• Strong price of anarchy
• The traveling salesman problem and its variations
• A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Approximate Strong Equilibrium in Job Scheduling Games
• Mathematical analysis II. Transl. from the 4th Russian edition by Roger Cooke
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multitask \(n\)-vehicle exploration problem: complexity and algorithm