A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem

Stanojević, Bogdana; Stanojević, Milan

Rezultati

eNauka > Rezultati > A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem

Naziv:	A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem
Autori:	Stanojević, Bogdana ; Stanojević, Milan
Godina:	2019
Publikacija:	RAIRO - Operations Research
ISSN:	0399-0559 RAIRO: Operations Research / Revue Francaise D#automatique, Informatique, Recherche Operationnelle Pretraži identifikator
Izdavač:	EDP Sciences
Tip rezultata:	Naučni članak
Kolacija:	vol. 53 br. 4 str. 1229-1244
DOI:	10.1051/ro/2018083
WoS-ID:	000506012200009
Scopus-ID:	2-s2.0-85070214857
URI:	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1194 https://enauka.gov.rs/handle/123456789/133703 https://rfos.fon.bg.ac.rs/handle/123456789/1935 https://plus.cobiss.net/cobiss/sr/sr/bib/108769033#izum.si
Projekat:	Optimization of Distributive and Reverse Flows in Logistic Systems Multimodal Biometry in Identity Management
Izvor metapodataka:	Migracija
M-kategorija:	23M23 - Rad u međ. časopisu

2
SCOPUS^TM

2
OpenCitations

2
WEB OF SCIENCE^TM

Alt metrika

Dimensions

Pronađi DOI

Pronalaženje DOI u servisu CrossRef-u na osnovu meta-podataka u zapisu. Prikazaće se DOI (i metapodaci) čiji se podaci najviše poklapaju. OPREZ - to ne mora biti ta publikacija.

Unpaywall

Rezultati na eNauka su zaštićeni autorskim pravima i sva prava su zadržana, osim ako nije drugačije naznačeno.