Optimal routing and scheduling in a time-dependent and directed multi-graph: a multi-agent temporal rural postman problem. Article Swipe
Somnath Buriuly
,
Leena Vachhani
,
Arpita Sinha
,
Sunita Chauhan
,
Sivapragasam Ravitharan
·
YOU?
·
· 2021
· Open Access
·
YOU?
·
· 2021
· Open Access
·
Time-dependent (or temporal) properties may arise in many practical static network search problems, for example routing and scheduling of railway track inspection where availability of track for inspection depends on the rail-schedule. In the absence of side constraints this routing and scheduling problem is a multi-agent rural postman problem on a temporal directed network; having temporal attributes motivated from railway track unavailabilities. This work presents a novel Mixed Integer Linear Programming (MILP) formulation model for a Multi-agent Temporal Rural Postman Problem (MTRPP), and proposes theory for temporal graphs to support the model. A modified Benders' decomposition algorithm is also proposed to address the non-convex unavailability constraints occurring in its sub-problems. Furthermore, a polynomial time algorithm is designed to address this sub-problem, while restraining the NP-Hard part to the master problem. A simulation study showing application in rail-track inspection using track-based-agents is presented, alongside comparison study showing improved results in smaller and sparser graphs compared to Time-Dependent Rural Postman Problem (TDRPP) which is developed over temporal attributes arising due to congestion in roadway networks.
Related Topics
Concepts
Unavailability
Computer science
Integer programming
Mathematical optimization
Scheduling (production processes)
Schedule
Routing (electronic design automation)
Job shop scheduling
Arc routing
Time complexity
Track (disk drive)
Distributed computing
Algorithm
Mathematics
Computer network
Statistics
Operating system
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://export.arxiv.org/pdf/2101.04950
- OA Status
- green
- References
- 17
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W3121058428
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W3121058428Canonical identifier for this work in OpenAlex
- Title
-
Optimal routing and scheduling in a time-dependent and directed multi-graph: a multi-agent temporal rural postman problem.Work title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-01-13Full publication date if available
- Authors
-
Somnath Buriuly, Leena Vachhani, Arpita Sinha, Sunita Chauhan, Sivapragasam RavitharanList of authors in order
- Landing page
-
https://export.arxiv.org/pdf/2101.04950Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://export.arxiv.org/pdf/2101.04950Direct OA link when available
- Concepts
-
Unavailability, Computer science, Integer programming, Mathematical optimization, Scheduling (production processes), Schedule, Routing (electronic design automation), Job shop scheduling, Arc routing, Time complexity, Track (disk drive), Distributed computing, Algorithm, Mathematics, Computer network, Statistics, Operating systemTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
17Number of works referenced by this work
- Related works (count)
-
20Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W3121058428 |
|---|---|
| doi | |
| ids.mag | 3121058428 |
| ids.openalex | https://openalex.org/W3121058428 |
| fwci | |
| type | preprint |
| title | Optimal routing and scheduling in a time-dependent and directed multi-graph: a multi-agent temporal rural postman problem. |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10567 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9883999824523926 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2209 |
| topics[0].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[0].display_name | Vehicle Routing Optimization Methods |
| topics[1].id | https://openalex.org/T11596 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.984499990940094 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Constraint Satisfaction and Optimization |
| topics[2].id | https://openalex.org/T11223 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9438999891281128 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2209 |
| topics[2].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[2].display_name | Maritime Ports and Logistics |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C2780505938 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7244265079498291 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q17093282 |
| concepts[0].display_name | Unavailability |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.6648215055465698 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C56086750 |
| concepts[2].level | 2 |
| concepts[2].score | 0.6265696287155151 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q6042592 |
| concepts[2].display_name | Integer programming |
| concepts[3].id | https://openalex.org/C126255220 |
| concepts[3].level | 1 |
| concepts[3].score | 0.5844237804412842 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[3].display_name | Mathematical optimization |
| concepts[4].id | https://openalex.org/C206729178 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5224077701568604 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q2271896 |
| concepts[4].display_name | Scheduling (production processes) |
| concepts[5].id | https://openalex.org/C68387754 |
| concepts[5].level | 2 |
| concepts[5].score | 0.4994964599609375 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q7271585 |
| concepts[5].display_name | Schedule |
| concepts[6].id | https://openalex.org/C74172769 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4919250011444092 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q1446839 |
| concepts[6].display_name | Routing (electronic design automation) |
| concepts[7].id | https://openalex.org/C55416958 |
| concepts[7].level | 3 |
| concepts[7].score | 0.4838199019432068 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q6206757 |
| concepts[7].display_name | Job shop scheduling |
| concepts[8].id | https://openalex.org/C2778536092 |
| concepts[8].level | 3 |
| concepts[8].score | 0.4640447497367859 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q4785038 |
| concepts[8].display_name | Arc routing |
| concepts[9].id | https://openalex.org/C311688 |
| concepts[9].level | 2 |
| concepts[9].score | 0.4437802731990814 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q2393193 |
| concepts[9].display_name | Time complexity |
| concepts[10].id | https://openalex.org/C89992363 |
| concepts[10].level | 2 |
| concepts[10].score | 0.4338320195674896 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q5961558 |
| concepts[10].display_name | Track (disk drive) |
| concepts[11].id | https://openalex.org/C120314980 |
| concepts[11].level | 1 |
| concepts[11].score | 0.42197442054748535 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[11].display_name | Distributed computing |
| concepts[12].id | https://openalex.org/C11413529 |
| concepts[12].level | 1 |
| concepts[12].score | 0.23446106910705566 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[12].display_name | Algorithm |
| concepts[13].id | https://openalex.org/C33923547 |
| concepts[13].level | 0 |
| concepts[13].score | 0.16638723015785217 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[13].display_name | Mathematics |
| concepts[14].id | https://openalex.org/C31258907 |
| concepts[14].level | 1 |
| concepts[14].score | 0.15809205174446106 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[14].display_name | Computer network |
| concepts[15].id | https://openalex.org/C105795698 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q12483 |
| concepts[15].display_name | Statistics |
| concepts[16].id | https://openalex.org/C111919701 |
| concepts[16].level | 1 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q9135 |
| concepts[16].display_name | Operating system |
| keywords[0].id | https://openalex.org/keywords/unavailability |
| keywords[0].score | 0.7244265079498291 |
| keywords[0].display_name | Unavailability |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.6648215055465698 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/integer-programming |
| keywords[2].score | 0.6265696287155151 |
| keywords[2].display_name | Integer programming |
| keywords[3].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[3].score | 0.5844237804412842 |
| keywords[3].display_name | Mathematical optimization |
| keywords[4].id | https://openalex.org/keywords/scheduling |
| keywords[4].score | 0.5224077701568604 |
| keywords[4].display_name | Scheduling (production processes) |
| keywords[5].id | https://openalex.org/keywords/schedule |
| keywords[5].score | 0.4994964599609375 |
| keywords[5].display_name | Schedule |
| keywords[6].id | https://openalex.org/keywords/routing |
| keywords[6].score | 0.4919250011444092 |
| keywords[6].display_name | Routing (electronic design automation) |
| keywords[7].id | https://openalex.org/keywords/job-shop-scheduling |
| keywords[7].score | 0.4838199019432068 |
| keywords[7].display_name | Job shop scheduling |
| keywords[8].id | https://openalex.org/keywords/arc-routing |
| keywords[8].score | 0.4640447497367859 |
| keywords[8].display_name | Arc routing |
| keywords[9].id | https://openalex.org/keywords/time-complexity |
| keywords[9].score | 0.4437802731990814 |
| keywords[9].display_name | Time complexity |
| keywords[10].id | https://openalex.org/keywords/track |
| keywords[10].score | 0.4338320195674896 |
| keywords[10].display_name | Track (disk drive) |
| keywords[11].id | https://openalex.org/keywords/distributed-computing |
| keywords[11].score | 0.42197442054748535 |
| keywords[11].display_name | Distributed computing |
| keywords[12].id | https://openalex.org/keywords/algorithm |
| keywords[12].score | 0.23446106910705566 |
| keywords[12].display_name | Algorithm |
| keywords[13].id | https://openalex.org/keywords/mathematics |
| keywords[13].score | 0.16638723015785217 |
| keywords[13].display_name | Mathematics |
| keywords[14].id | https://openalex.org/keywords/computer-network |
| keywords[14].score | 0.15809205174446106 |
| keywords[14].display_name | Computer network |
| language | en |
| locations[0].id | mag:3121058428 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | submittedVersion |
| locations[0].raw_type | |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | arXiv (Cornell University) |
| locations[0].landing_page_url | http://export.arxiv.org/pdf/2101.04950 |
| authorships[0].author.id | https://openalex.org/A5033265416 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-5432-4516 |
| authorships[0].author.display_name | Somnath Buriuly |
| authorships[0].countries | AU |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I56590836 |
| authorships[0].affiliations[0].raw_affiliation_string | Monash#N# University |
| authorships[0].institutions[0].id | https://openalex.org/I56590836 |
| authorships[0].institutions[0].ror | https://ror.org/02bfwt286 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I56590836 |
| authorships[0].institutions[0].country_code | AU |
| authorships[0].institutions[0].display_name | Monash University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Somnath Buriuly |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Monash#N# University |
| authorships[1].author.id | https://openalex.org/A5038367848 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-7869-6437 |
| authorships[1].author.display_name | Leena Vachhani |
| authorships[1].countries | IN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I162827531 |
| authorships[1].affiliations[0].raw_affiliation_string | Indian Institute of Technology Bombay |
| authorships[1].institutions[0].id | https://openalex.org/I162827531 |
| authorships[1].institutions[0].ror | https://ror.org/02qyf5152 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I162827531 |
| authorships[1].institutions[0].country_code | IN |
| authorships[1].institutions[0].display_name | Indian Institute of Technology Bombay |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Leena Vachhani |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Indian Institute of Technology Bombay |
| authorships[2].author.id | https://openalex.org/A5090008120 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-9116-3467 |
| authorships[2].author.display_name | Arpita Sinha |
| authorships[2].countries | IN |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I162827531 |
| authorships[2].affiliations[0].raw_affiliation_string | Indian Institute of Technology Bombay |
| authorships[2].institutions[0].id | https://openalex.org/I162827531 |
| authorships[2].institutions[0].ror | https://ror.org/02qyf5152 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I162827531 |
| authorships[2].institutions[0].country_code | IN |
| authorships[2].institutions[0].display_name | Indian Institute of Technology Bombay |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Arpita Sinha |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Indian Institute of Technology Bombay |
| authorships[3].author.id | https://openalex.org/A5010733071 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-0558-3941 |
| authorships[3].author.display_name | Sunita Chauhan |
| authorships[3].countries | AU |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I56590836 |
| authorships[3].affiliations[0].raw_affiliation_string | Monash#N# University |
| authorships[3].institutions[0].id | https://openalex.org/I56590836 |
| authorships[3].institutions[0].ror | https://ror.org/02bfwt286 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I56590836 |
| authorships[3].institutions[0].country_code | AU |
| authorships[3].institutions[0].display_name | Monash University |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Sunita Chauhan |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Monash#N# University |
| authorships[4].author.id | https://openalex.org/A5020057613 |
| authorships[4].author.orcid | https://orcid.org/0000-0001-8837-0468 |
| authorships[4].author.display_name | Sivapragasam Ravitharan |
| authorships[4].countries | AU |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I56590836 |
| authorships[4].affiliations[0].raw_affiliation_string | Monash#N# University |
| authorships[4].institutions[0].id | https://openalex.org/I56590836 |
| authorships[4].institutions[0].ror | https://ror.org/02bfwt286 |
| authorships[4].institutions[0].type | education |
| authorships[4].institutions[0].lineage | https://openalex.org/I56590836 |
| authorships[4].institutions[0].country_code | AU |
| authorships[4].institutions[0].display_name | Monash University |
| authorships[4].author_position | last |
| authorships[4].raw_author_name | Sivapragasam Ravitharan |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | Monash#N# University |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | http://export.arxiv.org/pdf/2101.04950 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Optimal routing and scheduling in a time-dependent and directed multi-graph: a multi-agent temporal rural postman problem. |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-10-10T17:16:08.811792 |
| primary_topic.id | https://openalex.org/T10567 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9883999824523926 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2209 |
| primary_topic.subfield.display_name | Industrial and Manufacturing Engineering |
| primary_topic.display_name | Vehicle Routing Optimization Methods |
| related_works | https://openalex.org/W2614524575, https://openalex.org/W634279757, https://openalex.org/W2506822652, https://openalex.org/W3122727062, https://openalex.org/W2475043317, https://openalex.org/W2378721481, https://openalex.org/W3200238541, https://openalex.org/W2009375919, https://openalex.org/W2765549113, https://openalex.org/W2029172743, https://openalex.org/W2253864008, https://openalex.org/W2167020160, https://openalex.org/W2355125716, https://openalex.org/W2904476983, https://openalex.org/W1974082921, https://openalex.org/W66433610, https://openalex.org/W2921939944, https://openalex.org/W3008693879, https://openalex.org/W1481517764, https://openalex.org/W271419371 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | mag:3121058428 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | arXiv (Cornell University) |
| best_oa_location.landing_page_url | http://export.arxiv.org/pdf/2101.04950 |
| primary_location.id | mag:3121058428 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | submittedVersion |
| primary_location.raw_type | |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | arXiv (Cornell University) |
| primary_location.landing_page_url | http://export.arxiv.org/pdf/2101.04950 |
| publication_date | 2021-01-13 |
| publication_year | 2021 |
| referenced_works | https://openalex.org/W2155694204, https://openalex.org/W2006417121, https://openalex.org/W2221478594, https://openalex.org/W1881841366, https://openalex.org/W2120070400, https://openalex.org/W2885173094, https://openalex.org/W816430833, https://openalex.org/W1730509907, https://openalex.org/W2031669620, https://openalex.org/W2123789618, https://openalex.org/W2805037770, https://openalex.org/W2752872774, https://openalex.org/W368789077, https://openalex.org/W2126141749, https://openalex.org/W2063045209, https://openalex.org/W2013188187, https://openalex.org/W1980621217 |
| referenced_works_count | 17 |
| abstract_inverted_index.A | 92, 130 |
| abstract_inverted_index.a | 44, 50, 65, 75, 111 |
| abstract_inverted_index.In | 32 |
| abstract_inverted_index.in | 6, 107, 135, 148, 170 |
| abstract_inverted_index.is | 43, 97, 115, 140, 161 |
| abstract_inverted_index.of | 18, 24, 35 |
| abstract_inverted_index.on | 29, 49 |
| abstract_inverted_index.to | 88, 100, 117, 126, 154, 168 |
| abstract_inverted_index.(or | 1 |
| abstract_inverted_index.and | 16, 40, 82, 150 |
| abstract_inverted_index.due | 167 |
| abstract_inverted_index.for | 13, 26, 74, 85 |
| abstract_inverted_index.its | 108 |
| abstract_inverted_index.may | 4 |
| abstract_inverted_index.the | 30, 33, 90, 102, 123, 127 |
| abstract_inverted_index.This | 62 |
| abstract_inverted_index.also | 98 |
| abstract_inverted_index.from | 58 |
| abstract_inverted_index.many | 7 |
| abstract_inverted_index.over | 163 |
| abstract_inverted_index.part | 125 |
| abstract_inverted_index.side | 36 |
| abstract_inverted_index.this | 38, 119 |
| abstract_inverted_index.time | 113 |
| abstract_inverted_index.work | 63 |
| abstract_inverted_index.Mixed | 67 |
| abstract_inverted_index.Rural | 78, 156 |
| abstract_inverted_index.arise | 5 |
| abstract_inverted_index.model | 73 |
| abstract_inverted_index.novel | 66 |
| abstract_inverted_index.rural | 46 |
| abstract_inverted_index.study | 132, 144 |
| abstract_inverted_index.track | 20, 25, 60 |
| abstract_inverted_index.using | 138 |
| abstract_inverted_index.where | 22 |
| abstract_inverted_index.which | 160 |
| abstract_inverted_index.while | 121 |
| abstract_inverted_index.(MILP) | 71 |
| abstract_inverted_index.Linear | 69 |
| abstract_inverted_index.graphs | 87, 152 |
| abstract_inverted_index.having | 54 |
| abstract_inverted_index.master | 128 |
| abstract_inverted_index.model. | 91 |
| abstract_inverted_index.search | 11 |
| abstract_inverted_index.static | 9 |
| abstract_inverted_index.theory | 84 |
| abstract_inverted_index.(TDRPP) | 159 |
| abstract_inverted_index.Integer | 68 |
| abstract_inverted_index.NP-Hard | 124 |
| abstract_inverted_index.Postman | 79, 157 |
| abstract_inverted_index.Problem | 80, 158 |
| abstract_inverted_index.absence | 34 |
| abstract_inverted_index.address | 101, 118 |
| abstract_inverted_index.arising | 166 |
| abstract_inverted_index.depends | 28 |
| abstract_inverted_index.example | 14 |
| abstract_inverted_index.network | 10 |
| abstract_inverted_index.postman | 47 |
| abstract_inverted_index.problem | 42, 48 |
| abstract_inverted_index.railway | 19, 59 |
| abstract_inverted_index.results | 147 |
| abstract_inverted_index.roadway | 171 |
| abstract_inverted_index.routing | 15, 39 |
| abstract_inverted_index.showing | 133, 145 |
| abstract_inverted_index.smaller | 149 |
| abstract_inverted_index.sparser | 151 |
| abstract_inverted_index.support | 89 |
| abstract_inverted_index.(MTRPP), | 81 |
| abstract_inverted_index.Benders' | 94 |
| abstract_inverted_index.Temporal | 77 |
| abstract_inverted_index.compared | 153 |
| abstract_inverted_index.designed | 116 |
| abstract_inverted_index.directed | 52 |
| abstract_inverted_index.improved | 146 |
| abstract_inverted_index.modified | 93 |
| abstract_inverted_index.network; | 53 |
| abstract_inverted_index.presents | 64 |
| abstract_inverted_index.problem. | 129 |
| abstract_inverted_index.proposed | 99 |
| abstract_inverted_index.proposes | 83 |
| abstract_inverted_index.temporal | 51, 55, 86, 164 |
| abstract_inverted_index.algorithm | 96, 114 |
| abstract_inverted_index.alongside | 142 |
| abstract_inverted_index.developed | 162 |
| abstract_inverted_index.motivated | 57 |
| abstract_inverted_index.networks. | 172 |
| abstract_inverted_index.occurring | 106 |
| abstract_inverted_index.practical | 8 |
| abstract_inverted_index.problems, | 12 |
| abstract_inverted_index.temporal) | 2 |
| abstract_inverted_index.attributes | 56, 165 |
| abstract_inverted_index.comparison | 143 |
| abstract_inverted_index.congestion | 169 |
| abstract_inverted_index.inspection | 21, 27, 137 |
| abstract_inverted_index.non-convex | 103 |
| abstract_inverted_index.polynomial | 112 |
| abstract_inverted_index.presented, | 141 |
| abstract_inverted_index.properties | 3 |
| abstract_inverted_index.rail-track | 136 |
| abstract_inverted_index.scheduling | 17, 41 |
| abstract_inverted_index.simulation | 131 |
| abstract_inverted_index.Multi-agent | 76 |
| abstract_inverted_index.Programming | 70 |
| abstract_inverted_index.application | 134 |
| abstract_inverted_index.constraints | 37, 105 |
| abstract_inverted_index.formulation | 72 |
| abstract_inverted_index.multi-agent | 45 |
| abstract_inverted_index.restraining | 122 |
| abstract_inverted_index.Furthermore, | 110 |
| abstract_inverted_index.availability | 23 |
| abstract_inverted_index.sub-problem, | 120 |
| abstract_inverted_index.decomposition | 95 |
| abstract_inverted_index.sub-problems. | 109 |
| abstract_inverted_index.Time-Dependent | 155 |
| abstract_inverted_index.Time-dependent | 0 |
| abstract_inverted_index.rail-schedule. | 31 |
| abstract_inverted_index.unavailability | 104 |
| abstract_inverted_index.unavailabilities. | 61 |
| abstract_inverted_index.track-based-agents | 139 |
| cited_by_percentile_year | |
| countries_distinct_count | 2 |
| institutions_distinct_count | 5 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/11 |
| sustainable_development_goals[0].score | 0.6499999761581421 |
| sustainable_development_goals[0].display_name | Sustainable cities and communities |
| citation_normalized_percentile |