A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
From MaRDI portal
Publication:5624969
DOI10.1287/mnsc.17.12.B793zbMath0219.90021OpenAlexW2036244971MaRDI QIDQ5624969
Publication date: 1971
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.17.12.b793
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items
Integrated container loading software for pulp and paper industry, A branch-and-price-and-cut algorithm for the pattern minimization problem, Reel and sheet cutting at a paper mill, Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, Practical adaptations of the Gilmore-Gomory approach to cutting stock problems, Alternative configurations for cutting machines in a tube cutting mill, The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production, In situ column generation for a cutting-stock problem, Nesting planning based on production priorities and technological efficiency, The trim-loss and assortment problems: A survey, Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem, The constrained compartmentalized knapsack problem: mathematical models and solution methods, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows, On the one-dimensional stock cutting problem in the paper tube industry, Trim loss optimization by an improved differential evolution, A combined cutting-stock and lot-sizing problem, Cutting stock problems and solution procedures, One-dimensional cutting stock problems and solution procedures, Knowledge based approach to the cutting stock problem, Solving a combined cutting-stock and lot-sizing problem with a column generating procedure, One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming, Algorithms for the one-dimensional two-stage cutting stock problem, The maximum diversity assortment selection problem, Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns, The stochastic trim-loss problem, Glass cutting in a small firm, A typology of cutting and packing problems, Optimal solutions for the cutting stock problem, Load planning for shipments of low density products, Solving a two-dimensional trim-loss with MILP, Different transformations for solving non-convex trim-loss problems by MINLP, Modeling multistage cutting stock problems, Production planning and scheduling for an integrated container company, The cutting stock problem for large sections in the iron and steel industries, Row and column generation technique for a multistage cutting stock problem, One-dimensional cutting stock problem to minimize the number of different patterns
