Pages that link to "Item:Q930939"

The following pages link to Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939):

Displaying 42 items.

• 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems (Q296590) (← 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)
• Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642) (← 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)
• An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
• Fast heuristic for constrained homogenous T-shape cutting patterns (Q693480) (← links)
• New lower bounds for bin packing problems with conflicts (Q976310) (← links)
• An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
• A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
• Strips minimization in two-dimensional cutting stock of circular items (Q1040959) (← links)
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965) (← links)
• A heuristic for the problem of one-dimensional steel coil cutting (Q1983859) (← links)
• Improved state space relaxation for constrained two-dimensional guillotine cutting problems (Q1991111) (← links)
• Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem (Q2003574) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
• Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
• An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
• Order and static stability into the strip packing problem (Q2259026) (← links)
• Lower bounds for three-dimensional multiple-bin-size bin packing problems (Q2260892) (← links)
• Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
• Deterministic model for customized pilot manufacture production with various backplane sizes (Q2310672) (← links)
• On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (Q2351163) (← links)
• Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns (Q2356096) (← links)
• Triple-solution approach for the strip packing problem with two-staged patterns (Q2410108) (← links)
• A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
• Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search (Q2631244) (← links)
• Arc-flow model for the two-dimensional guillotine cutting stock problem (Q2654387) (← links)
• A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
• An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts (Q2675700) (← links)
• Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
• Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns (Q2811482) (← links)
• Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem (Q2830956) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
• Cutting and Packing Problems with Placement Constraints (Q4634975) (← links)
• O problema de corte de estoque em indústrias de móveis de pequeno e médio portes (Q4905623) (← links)
• Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
• An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
• Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)