Pages that link to "Item:Q1877899"
From MaRDI portal
The following pages link to A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899):
Displaying 31 items.
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems (Q296590) (← links)
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem (Q296697) (← links)
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- Trim loss optimization by an improved differential evolution (Q474531) (← links)
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- A multi-objective programming approach to 1.5-dimensional assortment problem (Q858415) (← links)
- Characterization and modelling of guillotine constraints (Q930945) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
- An agent-based approach to the two-dimensional guillotine bin packing problem (Q1011220) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- A new quasi-human algorithm for solving the packing problem of unit equilateral triangles (Q1723821) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- Three-dimensional container loading models with cargo stability and load bearing constraints (Q1761946) (← links)
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects (Q2189880) (← links)
- An EDA for the 2D knapsack problem with guillotine constraint (Q2418151) (← links)
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem (Q2643950) (← links)
- Infeasibility handling in genetic algorithm using nested domains for production planning (Q2655963) (← links)
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects (Q2803261) (← links)
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces (Q3401326) (← links)
- A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM (Q3503066) (← links)
- Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints (Q5270072) (← links)