Pages that link to "Item:Q5650410"
From MaRDI portal
The following pages link to Minimizing expected travel time on geometrical patterns by optimal probability rearrangements (Q5650410):
Displaying 10 items.
- Methods for the one-dimensional space allocation problem (Q916571) (← links)
- Dynamic placement of records and the classical occupancy problem (Q1145997) (← links)
- Record allocation for minimizing seek delay (Q1156493) (← links)
- Optimization and approximation algorithm for placement of records on linear storage devices (Q1158748) (← links)
- Rearranging data to maximize the efficiency of compression (Q1263976) (← links)
- Optimal product and server locations in one-dimensional storage racks (Q1291699) (← links)
- A two-carousel storage location problem (Q1870804) (← links)
- A Benders decomposition approach to product location in carousel storage systems (Q2288989) (← links)
- Near-optimal heuristics for an assignment problem in mass storage (Q4065020) (← links)
- One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations (Q6160198) (← links)