Pages that link to "Item:Q2449077"
From MaRDI portal
The following pages link to On the complexity of container stowage planning problems (Q2449077):
Displaying 19 items.
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification (Q297241) (← links)
- Stowage planning for container ships: a heuristic algorithm to reduce the number of shifts (Q319754) (← links)
- Complexity results for storage loading problems with stacking constraints (Q321101) (← links)
- Robust storage loading problems with stacking and payload constraints (Q323109) (← links)
- Scheduling cranes at an indented berth (Q323166) (← links)
- A biased random-key genetic algorithm for the container pre-marshalling problem (Q342512) (← links)
- Stowage planning for container ships to reduce the number of shifts (Q1383119) (← links)
- Container ship stowage problem complexity and connection to the coloring of circle graphs (Q1570840) (← links)
- An exact algorithm for the unrestricted block relocation problem (Q1652624) (← links)
- Towards real-time automated stowage planning -- optimizing constraint test ordering (Q1680052) (← links)
- Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018) (Q2030320) (← links)
- The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
- Integer linear programming models for the containership stowage problem (Q2209212) (← links)
- Matheuristics for slot planning of container vessel bays (Q2286874) (← links)
- An asymptotically optimal algorithm for online stacking (Q6040850) (← links)
- Cost minimizing planning of container inspection and repair in multiple facilities (Q6103189) (← links)
- Uncertainty in maritime ship routing and scheduling: a literature review (Q6112538) (← links)
- Approximate dynamic programming for container stacking (Q6113333) (← links)
- Reconfiguring shortest paths in graphs (Q6623589) (← links)
