Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
From MaRDI portal
Publication:5650410
DOI10.1016/S0019-9958(72)90211-2zbMath0241.05021MaRDI QIDQ5650410
Publication date: 1972
Published in: Information and Control (Search for Journal in Brave)
Geometric probability and stochastic geometry (60D05) Combinatorial probability (60C05) Theory of error-correcting codes and error-detecting codes (94B99) Designs and configurations (05B99)
Related Items (10)
Dynamic placement of records and the classical occupancy problem ⋮ One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations ⋮ Record allocation for minimizing seek delay ⋮ Optimization and approximation algorithm for placement of records on linear storage devices ⋮ Methods for the one-dimensional space allocation problem ⋮ Near-optimal heuristics for an assignment problem in mass storage ⋮ A Benders decomposition approach to product location in carousel storage systems ⋮ Rearranging data to maximize the efficiency of compression ⋮ Optimal product and server locations in one-dimensional storage racks ⋮ A two-carousel storage location problem
This page was built for publication: Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
