Pages that link to "Item:Q5321741"
From MaRDI portal
The following pages link to A New Placement Heuristic for the Orthogonal Stock-Cutting Problem (Q5321741):
Displayed 50 items.
- A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang (Q306089) (← links)
- A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls (Q323548) (← links)
- An effective shaking procedure for 2D and 3D strip packing problems (Q336597) (← links)
- Efficient implementations of construction heuristics for the rectilinear block packing problem (Q337284) (← links)
- A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
- An exact strip packing algorithm based on canonical forms (Q339635) (← links)
- Corner occupying theorem for the two-dimensional integral rectangle packing problem (Q362160) (← links)
- A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- An iterated local search algorithm for a place scheduling problem (Q474475) (← links)
- Numerical optimization method for packing regular convex polygons (Q519665) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- A hybrid placement strategy for the three-dimensional strip packing problem (Q621967) (← links)
- A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) (← links)
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899) (← links)
- Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory (Q857327) (← links)
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
- Reactive GRASP for the strip-packing problem (Q941532) (← links)
- Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
- A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem (Q1015322) (← links)
- Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
- Mathematical justification of a heuristic for statistical correlation of real-life time series (Q1027625) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation (Q1652199) (← links)
- VCS: A new heuristic function for selecting boxes in the single container loading problem (Q1652261) (← links)
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem (Q1665961) (← links)
- Exact and heuristic methods for optimizing lock-quay system in inland waterway (Q1737520) (← links)
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem (Q1752837) (← links)
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint (Q1761795) (← links)
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945) (← links)
- An efficient deterministic heuristic for two-dimensional rectangular packing (Q1762123) (← links)
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
- A reference length approach for the 3D strip packing problem (Q1926699) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- A hybrid metaheuristic for the two-dimensional strip packing problem (Q2069243) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties (Q2116843) (← links)
- Scheduling unrelated additive manufacturing machines with practical constraints (Q2147124) (← links)
- Single workgroup scheduling problem with variable processing personnel (Q2173005) (← links)
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing (Q2267317) (← links)
- An open space based heuristic for the 2D strip packing problem with unloading constraints (Q2310581) (← links)
- Deterministic model for customized pilot manufacture production with various backplane sizes (Q2310672) (← links)