Different transformations for solving non-convex trim-loss problems by MINLP
- 16 March 1998
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 105 (3), 594-603
- https://doi.org/10.1016/s0377-2217(97)00066-0
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Comparison of different MINLP methods applied on certain chemical engineering problemsComputers & Chemical Engineering, 1996
- Different formulations for solving trim loss problems in a paper-converting mill with ILPComputers & Chemical Engineering, 1996
- Solving Mixed Integer Programming Problems Using Automatic ReformulationOperations Research, 1987
- An outer-approximation algorithm for a class of mixed-integer nonlinear programsMathematical Programming, 1986
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- An Improved Heuristic Procedure for a Nonlinear Cutting Stock ProblemManagement Science, 1976
- Controlling Cutting Pattern Changes in One-Dimensional Trim ProblemsOperations Research, 1975
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972
- A Heuristic Programming Solution to a Nonlinear Cutting Stock ProblemManagement Science, 1971
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960