Pages that link to "Item:Q5336847"

The following pages link to Multistage Cutting Stock Problems of Two and More Dimensions (Q5336847):

Displaying 50 items.

• Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
• Origin and early evolution of corner polyhedra (Q323202) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
• An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
• Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
• A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
• A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (Q439486) (← links)
• Reducing the number of cuts in generating three-staged cutting patterns (Q439502) (← links)
• The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
• A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
• The computer as an aid to physical distribution management (Q595498) (← links)
• Bun splitting: a practical cutting stock problem (Q610959) (← links)
• A linear optimization approach to the combined production planning model (Q647983) (← links)
• Recent advances on two-dimensional bin packing problems (Q697576) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
• Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints (Q729798) (← links)
• Network flows and non-guillotine cutting patterns (Q795062) (← links)
• Fixed charge problems with identical fixed charges (Q797500) (← links)
• A heuristic approach to the lumber allocation problem in hardwood dimension and furniture manufacturing (Q806790) (← links)
• Heuristics for sequencing cutting patterns (Q807386) (← links)
• Exact algorithm for generating two-segment cutting patterns of punched strips (Q837733) (← links)
• Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
• The combined cutting stock and lot-sizing problem in industrial processes (Q858391) (← links)
• The constrained compartmentalised knapsack problem (Q868151) (← links)
• Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412) (← links)
• Two-stage general block patterns for the two-dimensional cutting problem (Q878556) (← links)
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
• Characterization and modelling of guillotine constraints (Q930945) (← links)
• T-shape homogeneous block patterns for the two-dimensional cutting problem (Q933804) (← links)
• A coupling cutting stock-lot sizing problem in the paper industry (Q940851) (← links)
• A new heuristic algorithm for cuboids packing with no orientation constraints (Q954042) (← links)
• Heuristic algorithm for a cutting stock problem in the steel bridge construction (Q954060) (← links)
• An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
• Bidimensional packing by bilinear programming (Q1016113) (← links)
• Solving the subset-sum problem with a light-based device (Q1024028) (← links)
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
• Trim-loss pattern rearrangement and its relevance to the flat-glass industry (Q1055339) (← links)
• A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions (Q1055340) (← links)
• A new enumeration scheme for the knapsack problem (Q1095029) (← links)
• Practical adaptations of the Gilmore-Gomory approach to cutting stock problems (Q1101335) (← links)
• An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems (Q1127217) (← links)
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
• An analytical model for the container loading problem (Q1129950) (← links)
• Nesting planning based on production priorities and technological efficiency (Q1129962) (← links)
• The trim-loss and assortment problems: A survey (Q1143942) (← links)
• Cutting stock problems and solution procedures (Q1178994) (← links)
• An and-or-graph approach for two-dimensional cutting problems (Q1194741) (← links)