{"id":"https://openalex.org/W2890988800","doi":"https://doi.org/10.1051/ro/2018083","title":"A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem","display_name":"A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem","publication_year":2018,"publication_date":"2018-09-21","ids":{"openalex":"https://openalex.org/W2890988800","doi":"https://doi.org/10.1051/ro/2018083","mag":"2890988800"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2018083","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2018083","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067516121","display_name":"Bogdana Stanojevi\u0107","orcid":"https://orcid.org/0000-0003-4524-5354"},"institutions":[{"id":"https://openalex.org/I4390039372","display_name":"Mathematical Institute of the Serbian Academy of Sciences and Arts","ror":"https://ror.org/02jxk1021","country_code":null,"type":"education","lineage":["https://openalex.org/I1338511612","https://openalex.org/I4390039372"]},{"id":"https://openalex.org/I1338511612","display_name":"Serbian Academy of Sciences and Arts","ror":"https://ror.org/05m1y4204","country_code":"RS","type":"funder","lineage":["https://openalex.org/I1338511612"]}],"countries":["RS"],"is_corresponding":true,"raw_author_name":"Bogdana Stanojevi\u0107","raw_affiliation_strings":["Mathematical Institute of the Serbian Academy of Sciences and Arts, Serbia"],"affiliations":[{"raw_affiliation_string":"Mathematical Institute of the Serbian Academy of Sciences and Arts, Serbia","institution_ids":["https://openalex.org/I1338511612","https://openalex.org/I4390039372"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032961487","display_name":"Milan Stanojevi\u0107","orcid":"https://orcid.org/0000-0002-7898-3401"},"institutions":[{"id":"https://openalex.org/I4068193","display_name":"University of Belgrade","ror":"https://ror.org/02qsmb048","country_code":"RS","type":"education","lineage":["https://openalex.org/I4068193"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Milan Stanojevi\u0107","raw_affiliation_strings":["Faculty of Organizational Sciences, University of Belgrade, Serbia"],"affiliations":[{"raw_affiliation_string":"Faculty of Organizational Sciences, University of Belgrade, Serbia","institution_ids":["https://openalex.org/I4068193"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067516121"],"corresponding_institution_ids":["https://openalex.org/I1338511612","https://openalex.org/I4390039372"],"apc_list":null,"apc_paid":null,"fwci":0.1839,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.49902223,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"53","issue":"4","first_page":"1229","last_page":"1244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6556693911552429},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6465157866477966},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5939902067184448},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5218600034713745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4955354928970337},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4831940233707428},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4745829105377197},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.447932630777359},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4141498804092407}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6556693911552429},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6465157866477966},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5939902067184448},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5218600034713745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4955354928970337},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4831940233707428},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4745829105377197},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.447932630777359},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4141498804092407},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro/2018083","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2018083","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2019__53_4_1229_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2018083/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"pmh:oai:rfos.fon.bg.ac.rs:123456789/1935","is_oa":false,"landing_page_url":"https://rfos.fon.bg.ac.rs/handle/123456789/1935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Rairo-Operations Research","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1964647018","https://openalex.org/W1980012026","https://openalex.org/W2001591765","https://openalex.org/W2021446492","https://openalex.org/W2043944563","https://openalex.org/W2045560222","https://openalex.org/W2047780332","https://openalex.org/W2054372248","https://openalex.org/W2061608598","https://openalex.org/W2062303963","https://openalex.org/W2064823886","https://openalex.org/W2066753768","https://openalex.org/W2067946148","https://openalex.org/W2069539857","https://openalex.org/W2096652910","https://openalex.org/W2149157137","https://openalex.org/W2166619174","https://openalex.org/W2283364914","https://openalex.org/W2471811767"],"related_works":["https://openalex.org/W4205348974","https://openalex.org/W3182682721","https://openalex.org/W4386394964","https://openalex.org/W2080462934","https://openalex.org/W2182614003","https://openalex.org/W175643398","https://openalex.org/W2368660077","https://openalex.org/W4245568382","https://openalex.org/W90125000","https://openalex.org/W4231039027"],"abstract_inverted_index":{"The":[0,62],"main":[1],"contribution":[2],"of":[3,18,45,76,119],"this":[4],"paper":[5],"is":[6],"the":[7,15,26,77,82,94,112,117],"procedure":[8,57,100],"that":[9,48,70,93],"constructs":[10],"a":[11,38,42,72],"good":[12],"approximation":[13,75,121],"to":[14,28,40],"non-dominated":[16,68],"set":[17,44],"multiple":[19],"objective":[20],"linear":[21,30],"fractional":[22],"programming":[23],"problem":[24],"using":[25,122],"solutions":[27,47,64],"certain":[29],"optimization":[31],"problems.":[32],"In":[33],"our":[34,99],"approach":[35],"we":[36],"propose":[37],"way":[39],"generate":[41],"discrete":[43],"feasible":[46],"are":[49,65,101],"further":[50],"used":[51],"as":[52],"starting":[53],"points":[54,69],"in":[55,111],"any":[56],"for":[58],"deriving":[59],"efficient":[60,63],"solutions.":[61],"mapped":[66],"into":[67],"form":[71],"0th":[73],"order":[74],"Pareto":[78],"front.":[79],"We":[80,115],"report":[81],"computational":[83],"results":[84],"obtained":[85,96,105],"by":[86,97,106],"solving":[87],"random":[88],"generated":[89],"instances,":[90],"and":[91],"show":[92],"approximations":[95],"running":[98,107],"better":[102],"than":[103],"those":[104],"other":[108],"procedures":[109],"suggested":[110],"recent":[113],"literature.":[114],"evaluated":[116],"quality":[118],"each":[120],"classic":[123],"metrics.":[124]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}