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)
60D05: Geometric probability and stochastic geometry
60C05: Combinatorial probability
94B99: Theory of error-correcting codes and error-detecting codes
05B99: Designs and configurations
Related Items
One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations, Methods for the one-dimensional space allocation problem, Dynamic placement of records and the classical occupancy problem, Record allocation for minimizing seek delay, Optimization and approximation algorithm for placement of records on linear storage devices, Rearranging data to maximize the efficiency of compression, Optimal product and server locations in one-dimensional storage racks, A two-carousel storage location problem, A Benders decomposition approach to product location in carousel storage systems, Near-optimal heuristics for an assignment problem in mass storage