Pages that link to "Item:Q2504483"

The following pages link to Dynamic programming algorithms for the optimal cutting of equal rectangles (Q2504483):

Displaying 10 items.

• Extending the QCR method to general mixed-integer programs (Q662304) (← links)
• Simplest optimal guillotine cutting patterns for strips of identical circles (Q927192) (← links)
• T-shape homogeneous block patterns for the two-dimensional cutting problem (Q933804) (← links)
• Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights (Q965587) (← links)
• Reducing the number of variables in integer quadratic programming problem (Q967821) (← links)
• An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903) (← links)
• A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
• A new variable reduction technique for convex integer quadratic programs (Q2472944) (← links)
• A simple algorithm for generating optimal equal circle cutting patterns with minimum sections (Q2654515) (← links)
• A bi-objective guillotine cutting problem of stamping strips of equal circles (Q3056407) (← links)