Pages that link to "Item:Q610988"
From MaRDI portal
The following pages link to Generalized hyper-heuristics for solving 2D regular and irregular packing problems (Q610988):
Displayed 14 items.
- Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← links)
- An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
- Matheuristics for the irregular bin packing problem with free rotations (Q1751657) (← links)
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728) (← links)
- A new model and a hyper-heuristic approach for two-dimensional shelf space allocation (Q1942009) (← links)
- A RNN-based hyper-heuristic for combinatorial problems (Q2163777) (← links)
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning (Q2242334) (← links)
- Raster penetration map applied to the irregular packing problem (Q2312355) (← links)
- A hybrid chaos firefly algorithm for three-dimensional irregular packing problem (Q2338483) (← links)
- Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery (Q2658463) (← links)
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games (Q2664449) (← links)
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations (Q2669649) (← links)
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry (Q2803270) (← links)
- Packing Problems in Space Solved by CPLEX: An Experimental Analysis (Q3133910) (← links)