The stochastic trim-loss problem
type: Item
instance of: scholarly article
title: The stochastic trim-loss problem
zbMATH Open document ID: 1157.90489
published in: European Journal of Operational Research
publication date: 2009-04-08T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5541430
zbMATH Keywords: stochastic programming
zbMATH Keywords: trim-loss problem
zbMATH Keywords: branch and bound
author: Patrizia Beraldi
author: Maria Elena Bruni
author: Domenico Conforti
describes a project that uses: GAMS Model
describes a project that uses: LINDO
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.04.042
OpenAlex ID: W2061717788
Wikidata QID: Q62635467
cites work: On the cutting stock problem under stochastic demand
cites work: A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
cites work: A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
cites work: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
cites work: Introduction to Stochastic Programming
cites work: An improved branch and bound algorithm for mixed integer nonlinear programs
cites work: Global optimization. From theory to implementation.
cites work: Dual decomposition in stochastic integer programming
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
cites work: Roll assortment optimization in a paper mill: an integer programming approach
cites work: A simulated annealing heuristic for the one-dimensional cutting stock problem
cites work: A New Linear Programming Approach to the Cutting Stock Problem
cites work: A typology of cutting and packing problems
cites work: Ant colony optimization and local search for bin packing and cutting stock problems
cites work: Solution of nonconvex nonsmooth stochastic optimization problems
cites work: Handbook of test problems in local and global optimization
cites work: Generalized Benders decomposition
cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds
cites work: A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
cites work: Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
cites work: Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
cites work: Different transformations for solving non-convex trim-loss problems by MINLP
cites work: Q2762573
cites work: The trim-loss and assortment problems: A survey
cites work: Q4198056
cites work: A dynamic stochastic stock-cutting problem
cites work: Integrating SQP and branch-and-bound for mixed integer nonlinear programming
cites work: Q3775322
cites work: Incremental subgradient methods for nondifferentiable optimization
cites work: A branch and bound method for stochastic global optimization
cites work: Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
cites work: Q4848284
cites work: Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
cites work: A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape
cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem
cites work: A genetic algorithm solution for one-dimensional bundled stock cutting
cites work: An improved typology of cutting and packing problems
DOI: 10.1016/J.EJOR.2008.04.042
description: scientific article; zbMATH DE number 5541430