A Variant of Multi-task n-vehicle Exploration Problem: Maximizing Every Processor’s Average Profit

Yang-yang XU, Jin-chuan CUI

Acta Mathematicae Applicatae Sinica(English Series) ›› 2012, Vol. 28 ›› Issue (3) : 463-474.

PDF(225 KB)
中国科学院数学与系统科学研究院期刊网
PDF(225 KB)
Acta Mathematicae Applicatae Sinica(English Series) ›› 2012, Vol. 28 ›› Issue (3) : 463-474. DOI: 10.1007/s10255-012-0162-6
ARTICLES

A Variant of Multi-task n-vehicle Exploration Problem: Maximizing Every Processor’s Average Profit

  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Acta Mathematicae Applicatae Sinica(English Series), 2012, 28(3): 463-474 https://doi.org/10.1007/s10255-012-0162-6

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(225 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉