An LP-based approach to cutting stock problems with multiple objectives
From MaRDI portal
Publication:1825766
DOI10.1016/0377-2217(90)90353-DzbMath0684.90081OpenAlexW1990188779MaRDI QIDQ1825766
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90353-d
Applications of mathematical programming (90C90) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Production models (90B30) Combinatorial optimization (90C27)
Related Items
An interactive technique for the cutting stock problem with multiple objectives, An algorithm for the determination of optimal cutting patterns, The nesting problem in the leather manufacturing industry, An improved typology of cutting and packing problems, A note on the approximability of cutting stock problems, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem, A combined approach to the solution to the general one-dimensional cutting stock problem, Classification and literature review of integrated lot-sizing and cutting stock problems, Modified greedy heuristic for the one-dimensional cutting stock problem, A simulated annealing heuristic for the one-dimensional cutting stock problem, A typology of cutting and packing problems, Solving a two-dimensional trim-loss with MILP, Different transformations for solving non-convex trim-loss problems by MINLP, Enforcing minimum run length in the cutting stock problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed charge problems with identical fixed charges
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Strukturierung von Entscheidungsprozessen bei mehrfacher Zielsetzung
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Optimal solutions for the cutting stock problem
- The Trim Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Linear programming with multiple objective functions: Step method (stem)