The stochastic trim-loss problem
From MaRDI portal
Publication:1011257
DOI10.1016/j.ejor.2008.04.042zbMath1157.90489OpenAlexW2061717788WikidataQ62635467 ScholiaQ62635467MaRDI QIDQ1011257
Domenico Conforti, Patrizia Beraldi, Maria Elena Bruni
Publication date: 8 April 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.04.042
Related Items (9)
Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges ⋮ Cutting and packing problems under uncertainty: literature review and classification framework ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ A stochastic programming approach to the cutting stock problem with usable leftovers ⋮ A reinforcement learning approach to the stochastic cutting stock problem ⋮ A fuzzy stochastic model for telecommunications bandwidth brokers under probabilistic QoS measures ⋮ Water distribution networks design under uncertainty ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ SICOpt: Solution approach for nonlinear integer stochastic programming problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of nonconvex nonsmooth stochastic optimization problems
- On the cutting stock problem under stochastic demand
- Global optimization. From theory to implementation.
- The trim-loss and assortment problems: A survey
- A simulated annealing heuristic for the one-dimensional cutting stock problem
- A branch and bound method for stochastic global optimization
- Different transformations for solving non-convex trim-loss problems by MINLP
- Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
- Handbook of test problems in local and global optimization
- Dual decomposition in stochastic integer programming
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- A typology of cutting and packing problems
- A genetic algorithm solution for one-dimensional bundled stock cutting
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Roll assortment optimization in a paper mill: an integer programming approach
- Generalized Benders decomposition
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- An improved typology of cutting and packing problems
- A Dynamic Stochastic Stock-Cutting Problem
- Incremental Subgradient Methods for Nondifferentiable Optimization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
- A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape
- A New Linear Programming Approach to the Cutting Stock Problem
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- Introduction to Stochastic Programming
- Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
- Ant colony optimization and local search for bin packing and cutting stock problems
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
This page was built for publication: The stochastic trim-loss problem
