{"id":"https://openalex.org/W2160056724","doi":"https://doi.org/10.1080/00207160412331296715","title":"New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems","display_name":"New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems","publication_year":2005,"publication_date":"2005-02-15","ids":{"openalex":"https://openalex.org/W2160056724","doi":"https://doi.org/10.1080/00207160412331296715","mag":"2160056724"},"language":"en","primary_location":{"id":"doi:10.1080/00207160412331296715","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160412331296715","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5074528054","display_name":"V. N. Sastry","orcid":null},"institutions":[{"id":"https://openalex.org/I150312865","display_name":"Institute for Development and Research in Banking Technology","ror":"https://ror.org/00ta0g865","country_code":"IN","type":"government","lineage":["https://openalex.org/I150312865"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"V. N. Sastry","raw_affiliation_strings":["Institute for Development and Research in Banking Technology (IDRBT) , Road No.1, Castle Hills, Masab Tank, Hyderabad, 500 057, Andhra Pradesh,  India"],"affiliations":[{"raw_affiliation_string":"Institute for Development and Research in Banking Technology (IDRBT) , Road No.1, Castle Hills, Masab Tank, Hyderabad, 500 057, Andhra Pradesh,  India","institution_ids":["https://openalex.org/I150312865"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002171843","display_name":"T. N. Janakiraman","orcid":null},"institutions":[{"id":"https://openalex.org/I122964287","display_name":"National Institute of Technology Tiruchirappalli","ror":"https://ror.org/047x65e68","country_code":"IN","type":"education","lineage":["https://openalex.org/I122964287"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"T. N. Janakiraman","raw_affiliation_strings":["Department of Mathematics , National Institute of Technology , Tiruchirappalli, 620 015, Tamil Nadu,  India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics , National Institute of Technology , Tiruchirappalli, 620 015, Tamil Nadu,  India","institution_ids":["https://openalex.org/I122964287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110454618","display_name":"S. Ismail Mohideen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Ismail Mohideen","raw_affiliation_strings":["PG and Research Department of Mathematics , Jamal Mohamed College , Tiruchirappalli, 620 020, Tamil Nadu,  India"],"affiliations":[{"raw_affiliation_string":"PG and Research Department of Mathematics , Jamal Mohamed College , Tiruchirappalli, 620 020, Tamil Nadu,  India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002171843"],"corresponding_institution_ids":["https://openalex.org/I122964287"],"apc_list":null,"apc_paid":null,"fwci":5.9358,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.95415376,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"82","issue":"3","first_page":"289","last_page":"300"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11357","display_name":"Risk and Safety Analysis","score":0.98089998960495,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6426050662994385},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6281296610832214},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5620943307876587},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5225824117660522},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5220722556114197},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5154970288276672},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5071895122528076},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49384623765945435},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49280741810798645},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4727626442909241},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4573175311088562},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4536260664463043},{"id":"https://openalex.org/keywords/pareto-distribution","display_name":"Pareto distribution","score":0.43604668974876404},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.41562920808792114},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4141292870044708},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3588101863861084},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1121644675731659},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07821622490882874}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6426050662994385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6281296610832214},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5620943307876587},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5225824117660522},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5220722556114197},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5154970288276672},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5071895122528076},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49384623765945435},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49280741810798645},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4727626442909241},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4573175311088562},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4536260664463043},{"id":"https://openalex.org/C190373308","wikidata":"https://www.wikidata.org/wiki/Q837683","display_name":"Pareto distribution","level":2,"score":0.43604668974876404},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.41562920808792114},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4141292870044708},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3588101863861084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1121644675731659},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07821622490882874},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160412331296715","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160412331296715","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309013","display_name":"North Dakota State University","ror":"https://ror.org/05h1bnb22"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W141970363","https://openalex.org/W1973804680","https://openalex.org/W1982028039","https://openalex.org/W2062417951","https://openalex.org/W2063317962","https://openalex.org/W2100586428","https://openalex.org/W2772465513"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2523719706","https://openalex.org/W2375775343","https://openalex.org/W4293054712","https://openalex.org/W2161960576","https://openalex.org/W2388654557","https://openalex.org/W2767202586","https://openalex.org/W2030169809","https://openalex.org/W4307561361","https://openalex.org/W2366342492"],"abstract_inverted_index":{"Multi-objective":[0],"shortest":[1],"path":[2,57],"problem":[3],"(MOSPP)":[4],"is":[5,96,137,149,201],"an":[6,94,120,144],"active":[7],"area":[8],"of":[9,12,19,33,71,97,105,110,126,128,146,161,170,182,186,189],"research":[10],"because":[11],"its":[13],"application":[14],"in":[15,75,93,100,115,133,140],"a":[16,62,85,124,147,180,190],"large":[17],"number":[18,169],"systems":[20,32],"such":[21],"as":[22],"transportation":[23],"systems,":[24,26,29,41],"communication":[25],"power":[27],"transmission":[28],"pipeline":[30],"distribution":[31],"water,":[34],"gas,":[35],"blood":[36],"and":[37,44],"drainage,":[38],"neural":[39],"decision":[40],"production":[42],"planning":[43],"project":[45],"planning.":[46],"In":[47],"these":[48],"networks":[49],"it":[50,194],"becomes":[51],"necessary":[52],"to":[53,61,78,89,122],"find":[54,123,179],"the":[55,72,76,101,108,111,129,154,159,162,174],"best":[56],"from":[58,84],"one":[59],"node":[60,88],"specified":[63,86],"or":[64],"all":[65,80,90,107,153],"other":[66,91],"nodes.":[67],"The":[68,198],"computational":[69],"complexity":[70],"existing":[73,155],"algorithms":[74],"literature":[77],"compute":[79],"Pareto":[81,112,130,183],"minimum":[82,113,131,184],"paths":[83,114,132,185],"source":[87],"nodes":[92],"MOSPP":[95,145,188],"exponential":[98,116,168],"order":[99],"worst":[102],"case.":[103],"Instead":[104],"generating":[106],"values":[109,127],"time,":[117,135],"we":[118,177],"propose":[119],"algorithm":[121,156,200],"set":[125,181],"polynomial":[134],"which":[136],"very":[138],"significant":[139],"many":[141],"contexts.":[142],"If":[143],"network":[148,191],"having":[150],"negative":[151,163,196],"cycle,":[152,164],"only":[157],"indicate":[158],"existence":[160],"that":[165],"too":[166],"after":[167],"operations.":[171],"However,":[172],"applying":[173],"proposed":[175,199],"algorithm,":[176],"can":[178],"any":[187],"even":[192],"if":[193],"contains":[195],"cycles.":[197],"illustrated":[202],"with":[203],"examples.":[204]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}