Pages that link to "Item:Q3929394"

The following pages link to A New Linear Programming Approach to the Cutting Stock Problem (Q3929394):

Displaying 45 items.

• Integer linear programming models for the skiving stock problem (Q322686) (← 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)
• Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application (Q706851) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• An algorithm for the two-dimensional assortment problem (Q759646) (← links)
• Cutting optimization of structural tubes to build agricultural light aircrafts (Q839788) (← links)
• An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
• The stochastic trim-loss problem (Q1011257) (← links)
• Practical adaptations of the Gilmore-Gomory approach to cutting stock problems (Q1101335) (← links)
• A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems (Q1101337) (← links)
• Composite stock cutting through simulated annealing (Q1197089) (← links)
• Knowledge based approach to the cutting stock problem (Q1197096) (← links)
• The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373) (← links)
• The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production (Q1652159) (← links)
• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case (Q1730578) (← links)
• BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
• Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
• Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations (Q1825764) (← links)
• Optimal solutions for the cutting stock problem (Q1825768) (← links)
• LP models for bin packing and cutting stock problems (Q1847189) (← links)
• Heuristics for the integer one-dimensional cutting stock problem: A computational study (Q1919356) (← links)
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
• Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem (Q2003574) (← links)
• New symmetry-less ILP formulation for the classical one dimensional bin-packing problem (Q2019488) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
• An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
• An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• Heuristics for packing semifluids (Q2286867) (← links)
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
• An improved typology of cutting and packing problems (Q2643945) (← links)
• An integrated cutting stock and sequencing problem (Q2643965) (← links)
• Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
• Two dimensional guillotine cutting stock and scheduling problem in printing industry (Q2676408) (← links)
• Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
• Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
• The generalized assortment and best cutting stock length problems (Q3002687) (← links)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
• Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern (Q6067889) (← links)
• The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers (Q6069766) (← links)
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)