Pages that link to "Item:Q1825761"

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

Displaying 50 items.

• Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings (Q2295861) (← links)
• A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders (Q2307325) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• An application of deterministic and robust optimization in the wood cutting industry (Q2342918) (← links)
• The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
• A caving degree approach for the single container loading problem (Q2378453) (← links)
• The geometry of nesting problems: a tutorial (Q2384608) (← links)
• Exhaustive approaches to 2D rectangular perfect packings (Q2390210) (← links)
• Packing circles into perimeter-minimizing convex hulls (Q2423783) (← links)
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
• A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
• Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds (Q2456409) (← links)
• Design of rectangular packings using decoders of block structure (Q2457589) (← links)
• Solving the variable size bin packing problem with discretized formulations (Q2462559) (← links)
• An enumeration scheme to generate constrained exact checkerboard patterns (Q2462561) (← links)
• A polynomial algorithm for one problem of guillotine cutting (Q2465953) (← links)
• Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
• Solving a combined cutting-stock and lot-sizing problem with a column generating procedure (Q2482385) (← links)
• Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166) (← links)
• A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks (Q2503351) (← links)
• Dynamic programming algorithms for the optimal cutting of equal rectangles (Q2504483) (← links)
• L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing (Q2567707) (← links)
• Three-dimensional packing of items with limited load bearing strength (Q2569082) (← links)
• 3-D container packing heuristics (Q2574088) (← links)
• An improved typology of cutting and packing problems (Q2643945) (← links)
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
• A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
• The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951) (← links)
• Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
• An integrated cutting stock and sequencing problem (Q2643965) (← links)
• Alternative configurations for cutting machines in a tube cutting mill (Q2643969) (← links)
• Optimising the cutting of wood fibre plates in the hardboard industry (Q2643972) (← links)
• Arc-flow model for the two-dimensional guillotine cutting stock problem (Q2654387) (← links)
• Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem (Q2701176) (← links)
• Preface to the special issue on cutting and packing (Q2803251) (← links)
• The one-dimensional cutting stock problem with sequence-dependent cut losses (Q2803252) (← links)
• An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem (Q2803256) (← links)
• An improved best-fit heuristic for the orthogonal strip packing problem (Q2862160) (← links)
• A mathematical modeling approach to optimize composite parts placement in autoclave (Q2968492) (← links)
• A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes (Q3044033) (← links)
• Renovation of the cutting stock process (Q3055385) (← links)
• Packing problems and project scheduling models: an integrating perspective (Q3156648) (← links)
• Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms (Q3163365) (← links)
• Integer linear programming for a cutting problem in the wood-processing industry: a case study (Q3401328) (← links)
• Container loading with multi-drop constraints (Q3401329) (← links)
• The pinwheel pattern and its application to the manufacturer's pallet-loading problem (Q3401334) (← links)
• Evaluation of heuristics for a class-constrained lot-to-order matching problem in semiconductor manufacturing (Q3498894) (← links)