Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal retrieval in puzzle‐based storage with heuristic search and tabulation

From MaRDI portal
Publication:6065896
Jump to:navigation, search

DOI10.1002/net.22066zbMath1528.90011OpenAlexW3168816012MaRDI QIDQ6065896

Ariel Rosenfeld

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22066


zbMATH Keywords

algorithmsheuristic searchtabulationoptimal retrievalpuzzle-based storageoptimal retrieval in storage


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Warehousing in the e-commerce era: a survey
  • Optimizing automated sorting in warehouses: the minimum order spread sequencing problem
  • Checkers Is Solved
  • Release Time Scheduling and Hub Location for Next-Day Delivery
  • Puzzle-based storage systems
  • Advances in Cryptology - CRYPTO 2003




This page was built for publication: Optimal retrieval in puzzle‐based storage with heuristic search and tabulation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6065896&oldid=35495220"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 10 July 2024, at 05:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki