{"id":"https://openalex.org/W4225282910","doi":"https://doi.org/10.48786/inoc.2022.17","title":"Nash fairness solutions for balanced TSP","display_name":"Nash fairness solutions for balanced TSP","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4225282910","doi":"https://doi.org/10.48786/inoc.2022.17"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-03654554v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-03654554","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"10th International Network Optimization Conference (INOC)","raw_type":"info:eu-repo/semantics/conferenceObject"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.archives-ouvertes.fr/hal-03654554","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Nguyen, Minh Hieu","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nguyen, Minh Hieu","raw_affiliation_strings":["Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","institution_ids":["https://openalex.org/I4210099416"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100686340","display_name":"Vi\u1ebft H\u00f9ng Nguy\u1ec5n","orcid":"https://orcid.org/0000-0003-2181-3847","observed_orcids":["https://orcid.org/0000-0003-2181-3847"]},"institutions":[{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nguyen, Viet Hung","raw_affiliation_strings":["Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","institution_ids":["https://openalex.org/I4210099416"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110849486","display_name":"Thi Quynh Trang Vo","orcid":"https://orcid.org/0009-0000-7716-1951","observed_orcids":["https://orcid.org/0009-0000-7716-1951"]},"institutions":[{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vo, Thi Quynh Trang","raw_affiliation_strings":["Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","institution_ids":["https://openalex.org/I4210099416"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020748279","display_name":"Mourad Ba\u0131\u0308ou","orcid":"https://orcid.org/0000-0003-0735-7689","observed_orcids":["https://orcid.org/0000-0003-0735-7689"]},"institutions":[{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Baiou, Mourad","raw_affiliation_strings":["Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","institution_ids":["https://openalex.org/I4210099416"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210099416"],"apc_list":null,"apc_paid":null,"fwci":0.4886,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.51298834,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4650999903678894,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4650999903678894,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.459199994802475,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.021299999207258224,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"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/nash-equilibrium","display_name":"Nash equilibrium","score":0.828000009059906},{"id":"https://openalex.org/keywords/proportional-fair-scheduling","display_name":"proportional fair scheduling","score":0.7310000061988831},{"id":"https://openalex.org/keywords/pareto-optimality","display_name":"Pareto optimality","score":0.9390000104904175},{"id":"https://openalex.org/keywords/simple-additive-weighting","display_name":"simple additive weighting","score":0.9490000009536743},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.8479999899864197},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.6700000166893005},{"id":"https://openalex.org/keywords/total-cost-minimization","display_name":"total cost minimization","score":0.5400000214576721}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.626662015914917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6146528720855713},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38473016023635864},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2049354612827301}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:HAL:hal-03654554v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-03654554","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"10th International Network Optimization Conference (INOC)","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:HAL:hal-03654554v2","doi":null,"is_oa":true,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-03654554","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"10th International Network Optimization Conference (INOC)","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:HAL:hal-03654554v3","doi":null,"is_oa":true,"landing_page_url":"https://hal.science/hal-03654554","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"10th International Network Optimization Conference (INOC), Jun 2022, Aachen, Germany","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.48786/inoc.2022.17","doi":"https://doi.org/10.48786/inoc.2022.17","is_oa":true,"landing_page_url":"https://doi.org/10.48786/inoc.2022.17","pdf_url":null,"source":{"id":"https://openalex.org/S7407052771","display_name":"OpenProceedings","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dataset"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03654554v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-03654554","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"10th International Network Optimization Conference (INOC)","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4225318234","https://openalex.org/W2078701526","https://openalex.org/W4394906643","https://openalex.org/W4221144014","https://openalex.org/W4377223525","https://openalex.org/W6907864871","https://openalex.org/W3130098285","https://openalex.org/W3005335880","https://openalex.org/W1964201422","https://openalex.org/W2375089373"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,82,126,233],"consider":[4,106],"a":[5,25,47,71,84,107,115,132,192,235,246],"variant":[6],"of":[7,102,117,194,197,224,249],"the":[8,29,34,37,42,57,65,95,99,103,138,143,147,152,198,221,228],"Traveling":[9,15],"Salesman":[10,16],"Problem":[11,17],"(TSP),":[12],"called":[13],"Balanced":[14],"(BTSP)":[18],"[7].":[19],"The":[20],"BTSP":[21,170],"seeks":[22],"to":[23,52,70,93,241],"find":[24,53],"tour":[26,72],"which":[27,215,239],"has":[28],"smallest":[30,222,229],"maxmin":[31],"distance":[32,59,67],":":[33],"difference":[35],"between":[36,135],"maximum":[38],"edge":[39],"cost":[40,77,97,145,226],"and":[41,146,172,186,261],"minimum":[43],"one.":[44,177],"We":[45,105,155,163,178,208],"present":[46],"Mixed":[48],"Integer":[49],"Program":[50],"(MIP)":[51],"optimal":[54],"solutions":[55,130,158,168,182,214,218,244],"minimizing":[56,63,142,151],"max-min":[58,66,153,230],"for":[60,169],"BTSP.":[61,104],"However,":[62],"only":[64],"may":[68,173],"lead":[69],"with":[73],"an":[74],"inefficient":[75],"total":[76,96,144,225],"in":[78,114,129,245],"many":[79],"situations.":[80],"Hence,":[81],"propose":[83,234],"fair":[85,118],"way":[86],"based":[87,120,202],"on":[88,121,203,211,253],"Nash":[89,108,133,159],"equilibrium":[90,109,134],"[5],":[91],"[11]":[92],"inject":[94],"into":[98],"objective":[100],"function":[101],"as":[110],"it":[111],"is":[112],"defined":[113],"context":[116],"competition":[119],"proportional-fair":[122],"scheduling.":[123],"For":[124],"BTSP,":[125],"are":[127,183,216],"interested":[128],"achieving":[131],"two":[136,199],"players:":[137],"first":[139,164],"aims":[140,149],"at":[141,150],"second":[148],"distance.":[154,231],"call":[156],"such":[157],"Fairness":[160],"(NF)":[161],"solutions.":[162],"show":[165,179],"that":[166,180],"NF":[167,181,213,217,243],"exist":[171],"be":[174,188,259],"more":[175],"than":[176],"Pareto-optimal":[184],"[10]":[185],"can":[187],"found":[189],"by":[190],"optimizing":[191],"sequence":[193],"linear":[195],"combinations":[196],"players":[200],"objectives":[201],"Weighted":[204],"Sum":[205],"Method":[206],"[13].":[207],"then":[209],"focus":[210],"extreme":[212,242],"having":[219],"either":[220],"value":[223],"or":[227],"Finally,":[232],"Newton-based":[236],"iterative":[237],"algorithm":[238],"converges":[240],"polynomial":[247],"number":[248],"iterations.":[250],"Computational":[251],"results":[252],"smallsize":[254],"instances":[255],"from":[256],"TSPLIB":[257],"will":[258],"presented":[260],"commented.":[262]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2022-05-05T00:00:00"}