Pages that link to "Item:Q2901020"
From MaRDI portal
The following pages link to Extreme Point-Based Heuristics for Three-Dimensional Bin Packing (Q2901020):
Displayed 50 items.
- Integrated distribution and loading planning via a compact metaheuristic algorithm (Q257219) (← links)
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem (Q299777) (← links)
- A heuristic for solving large bin packing problems in two and three dimensions (Q300728) (← links)
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints (Q319021) (← links)
- The multiple container loading problem with preference (Q320625) (← links)
- The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints (Q322687) (← links)
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints (Q323423) (← links)
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
- The load-balanced multi-dimensional bin-packing problem (Q342477) (← links)
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints (Q367235) (← links)
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- An iterated local search algorithm for a place scheduling problem (Q474475) (← links)
- Container packing problem with balance constraints (Q480768) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- A hybrid placement strategy for the three-dimensional strip packing problem (Q621967) (← links)
- The multiple container loading cost minimization problem (Q635154) (← links)
- A particular approach for the three-dimensional packing problem with additional constraints (Q976016) (← links)
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints (Q1038331) (← links)
- Three-dimensional bin packing problem with variable bin height (Q1039777) (← links)
- A MIP-based slicing heuristic for three-dimensional bin packing (Q1686545) (← links)
- Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban (Q1694323) (← links)
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem (Q1752837) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints (Q1754206) (← links)
- The load planning problem for double-stack intermodal trains (Q1754216) (← links)
- A generalized bin packing problem for parcel delivery in last-mile logistics (Q1755394) (← links)
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
- A global search framework for practical three-dimensional packing with variable carton orientations (Q1761175) (← links)
- A reference length approach for the 3D strip packing problem (Q1926699) (← links)
- Space defragmentation for packing problems (Q1926954) (← links)
- A prototype column generation strategy for the multiple container loading problem (Q1926980) (← links)
- The pallet loading problem: three-dimensional bin packing with practical constraints (Q2023993) (← links)
- Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale (Q2077944) (← links)
- A data-driven approach for mixed-case palletization with support (Q2168642) (← links)
- Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints (Q2355860) (← links)
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem (Q2378415) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- A comparative review of 3D container loading algorithms (Q2803269) (← links)
- Data Structures for Higher-Dimensional Rectilinear Packing (Q2815459) (← links)
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints (Q2893344) (← links)
- A two-stage packing problem procedure (Q2968485) (← links)
- Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints (Q5087714) (← links)
- SPATIAL SCHEDULING AND WORKFORCE ASSIGNMENT PROBLEM IN BLOCK ASSEMBLY SHOP OF SHIPBUILDING (Q5411733) (← links)
- Efficient algorithms for orthogonal packing problems (Q5413218) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
- Airfreight forwarder's shipment planning: shipment consolidation and containerization (Q6065643) (← links)
- The multiple container loading problem with loading docks (Q6146635) (← links)