A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit

DOI10.1007/S10255-012-0162-6zbMath1254.05011OpenAlexW1730521403MaRDI QIDQ692666

Yang-yang Xu, Jin-Chuan Cui

Publication date: 6 December 2012

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

Full work available at URL: https://doi.org/10.1007/s10255-012-0162-6

zbMATH Keywords

NP-completefractional partitionmaximizing average profitMTNVEPmulti-task \(n\)-vehicle exploration problemstrongly NP-complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partitions of sets (05A18) Fractional programming (90C32) Permutations, words, matrices (05A05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

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

Cites Work

• A 71/60 theorem for bin packing
• A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Bounds for Certain Multiprocessing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit