A FULLY POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR LINEAR FRACTIONAL MULTIPLICATIVE PROGRAMMING PROBLEMS

Shen Zihui, Shen Peiping

Mathematica Numerica Sinica ›› 2019, Vol. 41 ›› Issue (2) : 212-218.

PDF(283 KB)
中国科学院数学与系统科学研究院期刊网
PDF(283 KB)
Mathematica Numerica Sinica ›› 2019, Vol. 41 ›› Issue (2) : 212-218. DOI: 10.12286/jssx.2019.2.212
Reviews

A FULLY POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR LINEAR FRACTIONAL MULTIPLICATIVE PROGRAMMING PROBLEMS

    {{javascript:window.custom_author_en_index=0;}}
  • {{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}}. Mathematica Numerica Sinica, 2019, 41(2): 212-218 https://doi.org/10.12286/jssx.2019.2.212

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(283 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉