{"id":"https://openalex.org/W57516052","doi":"https://doi.org/10.3217/jucs-016-03-0372","title":"Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach","display_name":"Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach","alternate_titles":[],"publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W57516052","doi":"https://doi.org/10.3217/jucs-016-03-0372","mag":"57516052"},"language":"en","primary_location":{"id":"mag:57516052","doi":null,"is_oa":true,"landing_page_url":"https://zenodo.org/record/7001085","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Zenodo (CERN European Organization for Nuclear Research)","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W57516052"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/7001085","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065625026","display_name":"Eduardo Camponogara","orcid":"https://orcid.org/0000-0002-0236-0689","observed_orcids":["https://orcid.org/0000-0002-0236-0689"]},"institutions":[{"id":"https://openalex.org/I4104125","display_name":"Universidade Federal de Santa Catarina","ror":"https://ror.org/041akq887","country_code":"BR","type":"education","lineage":["https://openalex.org/I4104125"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Eduardo Camponogara","raw_affiliation_strings":["- Universidade Federal de Santa Catarina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"- Universidade Federal de Santa Catarina","institution_ids":["https://openalex.org/I4104125"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018430788","display_name":"Ricardo Boveto Shima","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ricardo Boveto Shima","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065625026"],"corresponding_institution_ids":["https://openalex.org/I4104125"],"apc_list":null,"apc_paid":null,"fwci":2.8069,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.89102564,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4702000021934509,"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.4702000021934509,"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.4016000032424927,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.03840000182390213,"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/mobile-agents","display_name":"mobile agents","score":0.9629999995231628},{"id":"https://openalex.org/keywords/acyclic-graphs","display_name":"acyclic graphs","score":0.8930000066757202},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9179999828338623},{"id":"https://openalex.org/keywords/fully-polynomial-time-approximation-scheme","display_name":"fully polynomial time approximation scheme","score":0.843999981880188},{"id":"https://openalex.org/keywords/time-constraints","display_name":"time constraints","score":0.8029999732971191},{"id":"https://openalex.org/keywords/deadline-scheduling","display_name":"deadline scheduling","score":0.5490000247955322},{"id":"https://openalex.org/keywords/resource-collection","display_name":"resource collection","score":0.6299999952316284}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6079350709915161},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.606428325176239},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5723406672477722},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.46160855889320374},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4185388684272766},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4055935740470886},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3646266460418701},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.33174461126327515},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24261704087257385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1820114254951477}],"mesh":[],"locations_count":4,"locations":[{"id":"mag:57516052","doi":null,"is_oa":true,"landing_page_url":"https://zenodo.org/record/7001085","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Zenodo (CERN European Organization for Nuclear Research)","raw_type":null},{"id":"pmh:oai:zenodo.org:7001085","doi":null,"is_oa":true,"landing_page_url":"https://zenodo.org/record/7001085","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JUCS - Journal of Universal Computer Science 16((3)) 372-401","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.3217/jucs-016-03-0372","doi":"https://doi.org/10.3217/jucs-016-03-0372","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-016-03-0372","pdf_url":null,"source":{"id":"https://openalex.org/S4306400660","display_name":"TUGraz OPEN Library (Graz University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4092182","host_organization_name":"Graz University of Technology","host_organization_lineage":["https://openalex.org/I4092182"],"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":"DataPaper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.429.9125","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.9125","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jucs.org/jucs_16_3/mobile_agent_routing_with/jucs_16_03_0372_0401_camponogara.pdf","raw_type":"text"}],"best_oa_location":{"id":"mag:57516052","doi":null,"is_oa":true,"landing_page_url":"https://zenodo.org/record/7001085","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Zenodo (CERN European Organization for Nuclear Research)","raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W57516052.pdf","grobid_xml":"https://content.openalex.org/works/W57516052.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W90561696","https://openalex.org/W310105368","https://openalex.org/W1491580860","https://openalex.org/W1569990960","https://openalex.org/W1964443412","https://openalex.org/W1987420866","https://openalex.org/W2003811039","https://openalex.org/W2011039300","https://openalex.org/W2058479406","https://openalex.org/W2096297275","https://openalex.org/W2098432798","https://openalex.org/W2110824067","https://openalex.org/W2130626677","https://openalex.org/W2130679277","https://openalex.org/W2147799577","https://openalex.org/W2149056569","https://openalex.org/W2539947550","https://openalex.org/W2752885492","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W2565326781","https://openalex.org/W3120292281","https://openalex.org/W2356618629","https://openalex.org/W2539947550","https://openalex.org/W2405616940","https://openalex.org/W264528716","https://openalex.org/W1587119054","https://openalex.org/W7099366009","https://openalex.org/W2028866289","https://openalex.org/W22026916"],"abstract_inverted_index":{"Abstract:":[0],"Mobile":[1],"agent":[2,24,100],"technology":[3],"advocates":[4],"the":[5,11,46,59,74,114,121,124,133,153,156],"mobility":[6],"of":[7,13,94,118,155],"code":[8],"rather":[9],"than":[10],"transfer":[12],"data.":[14],"As":[15],"data":[16],"is":[17,126,136],"found":[18],"in":[19,80],"several":[20,32],"sites,":[21],"a":[22,53,63,71,92,98,129,139],"mobile":[23,99],"has":[25],"to":[26,30,38,45,73,90,101,112,123,161],"plan":[27],"an":[28],"itinerary":[29,48],"visit":[31],"sites":[33],"where":[34],"it":[35],"collects":[36],"resources":[37,60],"accomplish":[39],"its":[40,104],"mission.":[41],"This":[42,65],"gives":[43],"rise":[44],"mobile-agent":[47],"problem":[49,78,142],"(MIP)":[50],"which":[51],"seeks":[52],"route":[54],"maximizing":[55],"overall":[56],"benefit":[57],"from":[58,150],"while":[61],"meeting":[62],"deadline.":[64],"paper":[66,147],"formalizes":[67],"MIP":[68],"and":[69,132,144,158,167],"develops":[70],"reduction":[72],"resource":[75,169],"constrained":[76],"longest-path":[77],"(CLPP)":[79],"acyclic":[81],"graphs.":[82],"A":[83,106],"dynamic":[84],"programming":[85],"(DP)":[86],"algorithm":[87],"was":[88,110],"designed":[89],"produce":[91],"family":[93],"optimal":[95,125],"routes,":[96],"allowing":[97],"dynamically":[102],"revise":[103],"route.":[105],"fully-polynomial":[107],"approximation":[108],"scheme":[109],"developed":[111],"reduce":[113],"pseudo-polynomial":[115],"running":[116,134],"time":[117,135],"DP,":[119],"whereby":[120],"distance":[122],"controlled":[127],"by":[128,138],"parameter":[130],"\u025b":[131],"limited":[137],"polynomial":[140],"on":[141],"size":[143],"1/\u025b.":[145],"The":[146],"reports":[148],"results":[149],"experiments":[151],"assessing":[152],"performance":[154],"algorithms":[157],"discusses":[159],"extensions":[160],"handle":[162],"non-additive":[163,165],"objectives,":[164],"constraints,":[166],"probabilistic":[168],"constraints.":[170]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W57516052","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-19T14:11:59.513116","created_date":"2016-06-24T00:00:00"}
