Pages that link to "Item:Q2884561"
From MaRDI portal
The following pages link to An exact approach to the strip-packing problem (Q2884561):
Displaying 41 items.
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338) (← links)
- Single workgroup scheduling problem with variable processing personnel (Q2173005) (← links)
- The consecutive multiprocessor job scheduling problem (Q2178063) (← links)
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning (Q2242334) (← links)
- Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem (Q2250117) (← links)
- Order and static stability into the strip packing problem (Q2259026) (← links)
- Lower bounds for three-dimensional multiple-bin-size bin packing problems (Q2260892) (← 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)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints (Q2378414) (← links)
- Exhaustive approaches to 2D rectangular perfect packings (Q2390210) (← links)
- Triple-solution approach for the strip packing problem with two-staged patterns (Q2410108) (← links)
- A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces (Q2488910) (← links)
- Approximate strip packing: revisited (Q2629852) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
- A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
- Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques (Q2675702) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Upper bounds for heuristic approaches to the strip packing problem (Q2803257) (← links)
- Models of the nonguillotine sheet and strip rectangular packing problem (Q2815050) (← links)
- Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← links)
- Metaheuristics for truck loading in the car production industry (Q2968504) (← links)
- An Exact Algorithm for the Two-Dimensional Strip-Packing Problem (Q3098338) (← links)
- Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
- One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
- SPEEDUP-AWARE CO-SCHEDULES FOR EFFICIENT WORKLOAD MANAGEMENT (Q3458241) (← links)
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem (Q5058727) (← links)
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
- Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints (Q5087714) (← links)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing (Q6046946) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- Approximation Algorithms for Demand Strip Packing (Q6090894) (← links)
- Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model (Q6568471) (← links)