Pages that link to "Item:Q1091269"

The following pages link to Near-optimal solutions to one-dimensional cutting stock problems (Q1091269):

Displaying 47 items.

• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
• Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
• An effective solution for a real cutting stock problem in manufacturing plastic rolls (Q1026560) (← links)
• A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems (Q1101337) (← links)
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem (Q1127211) (← links)
• Cutting stock problems and solution procedures (Q1178994) (← links)
• One-dimensional cutting stock problems and solution procedures (Q1197082) (← links)
• Knowledge based approach to the cutting stock problem (Q1197096) (← links)
• Random search in the one-dimensional cutting stock problem (Q1278375) (← links)
• Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
• Procedures for solving a 1-dimensional cutting problem (Q1333482) (← links)
• Solving a cutting problem based on existing patterns (Q1333483) (← links)
• On the effectivity of gradient methods for cutting stock problems (Q1342431) (← links)
• Branch-and-price algorithms for the one-dimensional cutting stock problem (Q1380722) (← links)
• A new model for complete solutions to one-dimensional cutting stock problems. (Q1417501) (← links)
• Heuristic methods for gang-rip saw arbor design. (Q1420446) (← links)
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
• A combined approach to the solution to the general one-dimensional cutting stock problem (Q1777156) (← links)
• A one-dimensional cutting stock problem in the aluminium industry and its solution (Q1825753) (← links)
• One-dimensional cutting stock decisions for rolls with multiple quality grades (Q1825762) (← links)
• Optimal solutions for the cutting stock problem (Q1825768) (← links)
• A genetic algorithm solution for one-dimensional bundled stock cutting (Q1847176) (← links)
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193) (← links)
• Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
• A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry (Q1847199) (← links)
• One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576) (← links)
• A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems (Q1871643) (← links)
• Heuristics for the integer one-dimensional cutting stock problem: A computational study (Q1919356) (← links)
• Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
• The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
• Solving a combined cutting-stock and lot-sizing problem with a column generating procedure (Q2482385) (← links)
• Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
• Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
• An inexact bundle approach to cutting-stock problems (Q2899044) (← links)
• (Q3147525) (← links)
• An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths (Q3569837) (← links)
• Solving One-Dimensional Cutting Stock Problem with Discrete Demands and Capacitated Planning Objective (Q3583070) (← links)
• An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach (Q3804426) (← links)
• Selection and Design of Heuristic Procedures for Solving Roll Trim Problems (Q3807861) (← links)
• A column generation procedure for gang-rip saw arbor design and scheduling (Q4230062) (← links)
• Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems (Q4545662) (← links)
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem (Q4805783) (← links)
• The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers (Q6069766) (← links)