Pages that link to "Item:Q1127213"

The following pages link to An LP-based approach to a two-stage cutting stock problem (Q1127213):

Displaying 33 items.

• Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
• The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
• Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application (Q706851) (← links)
• Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
• A coupling cutting stock-lot sizing problem in the paper industry (Q940851) (← links)
• An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
• Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
• Bethlehem steel combines cutting stock and set covering to enhance customer service (Q1197085) (← links)
• The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373) (← links)
• Unbounded knapsack problem: Dynamic programming revisited (Q1569945) (← links)
• Row and column generation technique for a multistage cutting stock problem (Q1603313) (← links)
• Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
• A two-phase roll cutting problem (Q1825752) (← links)
• An LP-based approach to cutting stock problems with multiple objectives (Q1825766) (← links)
• LP models for bin packing and cutting stock problems (Q1847189) (← links)
• Modeling multistage cutting stock problems (Q1847197) (← links)
• Reel and sheet cutting at a paper mill (Q1885980) (← links)
• A combined cutting-stock and lot-sizing problem (Q1969834) (← links)
• A heuristic for the problem of one-dimensional steel coil cutting (Q1983859) (← links)
• An exact model for a slitting problem in the steel industry (Q2239876) (← links)
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
• An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
• The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951) (← links)
• A nested column generation algorithm to the meta slab allocation problem in the steel making industry (Q3055414) (← links)
• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem (Q3114706) (← links)
• (Q3705224) (← links)
• LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap (Q4596192) (← links)
• A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem (Q4596237) (← links)
• Two-Stage Cutting Stock Problem with Due Dates (Q4596454) (← links)
• Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem (Q4599321) (← links)
• Lp-Based Method For The Multi-Sheet Cutting Stock Problem (Q4834077) (← links)
• On Guillotine Separability of Squares and Rectangles. (Q6084407) (← links)
• A strong integer linear optimization model to the compartmentalized knapsack problem (Q6088168) (← links)