A branch-and-bound algorithm for the time-dependent rural postman problem (Q1628130): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.cor.2018.07.016 / rank | |||
Property / cites work | |||
Property / cites work: Time-dependent routing problems: a review / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vehicle dispatching with time-dependent travel times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Transforming arc routing into node routing problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arc routing problems with time-dependent service costs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q129426968 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.COR.2018.07.016 / rank | |||
Normal rank |
Latest revision as of 23:36, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A branch-and-bound algorithm for the time-dependent rural postman problem |
scientific article |
Statements
A branch-and-bound algorithm for the time-dependent rural postman problem (English)
0 references
3 December 2018
0 references