Pages that link to "Item:Q3401324"
From MaRDI portal
The following pages link to Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324):
Displaying 14 items.
- Robust mixed-integer linear programming models for the irregular strip packing problem (Q323210) (← links)
- Efficient implementations of construction heuristics for the rectilinear block packing problem (Q337284) (← links)
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem (Q1040080) (← links)
- Rotational polygon overlap minimization and compaction (Q1265289) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations (Q1756757) (← links)
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem (Q1762025) (← links)
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
- Mixed-integer programming models for nesting problems (Q2271127) (← links)
- Raster penetration map applied to the irregular packing problem (Q2312355) (← links)
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
- A personal perspective on problem solving by general purpose solvers (Q3566446) (← links)
- EFFICIENT OVERLAP DETECTION AND CONSTRUCTION ALGORITHMS FOR THE BITMAP SHAPE PACKING PROBLEM (Q4642060) (← links)
