A branch-and-bound algorithm for the time-dependent rural postman problem (Q1628130): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129426968, #quickstatements; #temporary_batch_1725413904772
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2018.07.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2885173094 / rank
 
Normal 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:41, 4 September 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

    Identifiers