Pages that link to "Item:Q1825761"

The following pages link to A typology of cutting and packing problems (Q1825761):

Displaying 50 items.

• Improving competitiveness in veneers production by a simple-to-use DSS. (Q1426707) (← links)
• An efficient approach for the multi-pallet loading problem (Q1569940) (← links)
• A method of optimal lattice packing of congruent oriented polygons in the plane (Q1576353) (← links)
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem (Q1592734) (← links)
• Densest translational lattice packing of non-convex polygons (Q1602949) (← links)
• Evaluation of algorithms for one-dimensional cutting (Q1603317) (← links)
• Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers (Q1652562) (← links)
• Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
• A heuristic approach to minimize the number of saw cycles in small-scale furniture factories (Q1686524) (← links)
• A generalized classification scheme for crane scheduling with interference (Q1698922) (← links)
• A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems (Q1720775) (← 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)
• BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
• Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
• Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
• Three-dimensional container loading models with cargo stability and load bearing constraints (Q1761946) (← links)
• Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544) (← links)
• A combined approach to the solution to the general one-dimensional cutting stock problem (Q1777156) (← links)
• Approximation algorithm for the oriented two-dimensional bin packing problem (Q1806892) (← links)
• A hybrid approach for optimization of one-dimensional cutting (Q1809853) (← links)
• Introducing global constraints in CHIP (Q1842796) (← links)
• A genetic algorithm solution for one-dimensional bundled stock cutting (Q1847176) (← links)
• Heuristics for the container loading problem (Q1847185) (← links)
• LP models for bin packing and cutting stock problems (Q1847189) (← links)
• A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
• A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
• Heuristics for the integer one-dimensional cutting stock problem: A computational study (Q1919356) (← links)
• Interactive procedures in large-scale two-dimensional cutting stock problems (Q1919382) (← links)
• A family of genetic algorithms for the pallet loading problem (Q1919852) (← links)
• Space defragmentation for packing problems (Q1926954) (← links)
• Packing chained items in aligned bins with applications to container transshipment and project scheduling (Q1935930) (← links)
• A moment based metric for 2-D and 3-D packing (Q1971998) (← links)
• Matching supply and demand in a sharing economy: classification, computational complexity, and application (Q1999391) (← links)
• Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
• Putting continuous metaheuristics to work in binary search spaces (Q2012877) (← links)
• The forgotten sons: warehousing systems for brick-and-mortar retail chains (Q2028872) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
• A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
• A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints (Q2140189) (← links)
• Multi-objective optimization of the 3D container stowage planning problem in a barge convoy system (Q2147079) (← links)
• Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
• Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
• A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber (Q2219513) (← links)
• A survey on the cutting and packing problems (Q2227258) (← links)
• Cutting ellipses from area-minimizing rectangles (Q2250089) (← links)
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing (Q2267317) (← links)