Shuffling heuristics for the storage location assignment in an AS/RS (Q4399000): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q126250571, #quickstatements; #temporary_batch_1718144409425
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted Lagrangean approach to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Traveling Salesman Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storage-Retrieval Interleaving in Automatic Warehousing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Storage Assignment in Automatic Warehousing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet identification for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An update of research / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126250571 / rank
 
Normal rank

Latest revision as of 00:24, 12 June 2024

scientific article; zbMATH DE number 1179696
Language Label Description Also known as
English
Shuffling heuristics for the storage location assignment in an AS/RS
scientific article; zbMATH DE number 1179696

    Statements