Pages that link to "Item:Q4427384"

The following pages link to Optimal Integer Solutions to Industrial Cutting Stock Problems (Q4427384):

Displaying 32 items.

• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
• An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
• Optimal wafer cutting in shuttle layout problems (Q719028) (← links)
• Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
• In situ column generation for a cutting-stock problem (Q868997) (← links)
• Practical adaptations of the Gilmore-Gomory approach to cutting stock problems (Q1101335) (← links)
• Bethlehem steel combines cutting stock and set covering to enhance customer service (Q1197085) (← links)
• A real-time one-dimensional cutting stock algorithm for balanced cutting patterns (Q1318665) (← links)
• Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
• The cutting stock problem in a hardboard industry: A case study. (Q1406647) (← links)
• The demand weighted vehicle routing problem (Q1754023) (← links)
• Knowledge-based systems for cutting stock problems (Q1825760) (← links)
• Optimal solutions for the cutting stock problem (Q1825768) (← links)
• Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
• Cutting aluminium coils with high length variabilities (Q1897383) (← links)
• A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
• One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214) (← links)
• Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)
• An integrated cutting stock and sequencing problem (Q2643965) (← links)
• When serial batch scheduling involves parallel batching decisions: a branch and price scheme (Q2669619) (← links)
• One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model (Q2803255) (← links)
• Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results (Q2884549) (← links)
• The generalized assortment and best cutting stock length problems (Q3002687) (← links)
• Renovation of the cutting stock process (Q3055385) (← links)
• Solving a bi-criterion cutting stock problem with open-ended demand: a case study (Q3156669) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• New integer programming formulations and an exact algorithm for the ordered cutting stock problem (Q3394020) (← links)
• Order Allocation for Stock Cutting in the Paper Industry (Q3635095) (← links)
• The cutting stock problem and integer rounding (Q3710296) (← links)
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem (Q4530667) (← links)