A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths-Reference-Cited by-同舟云学术

A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths

Published:2002-09 Issue:2 Volume:141 Page:274-294
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Belov G.,Scheithauer G.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference20 articles.

1. G. Belov, Das eindimensionale Zuschnittproblem mit mehreren Ausgangslängen, Diplomarbeit, Technische Universität Dresden, 2000

2. Z. Degraeve, M. Peeters, Optimal integer solutions to industrial cutting stock problems: Part 2, Benchmark results, Technical Report, Katholieke Universiteit Leuven, 2000

3. Cutting and packing;Dyckhoff,1997

4. A linear programming approach to the cutting-stock problem (Part II);Gilmore;Operations Research,1963

5. J. Kupke, Lösung von ganzzahligen Verschnittproblemen mit branch-and-price, Diplomarbeit, Universität zu Köln, 1998

Cited by 83 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Approach to the Integrated Cutting Stock and Pattern Sequencing Problem;2024

2. Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model;Discrete Applied Mathematics;2023-07

3. A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem;Central European Journal of Operations Research;2023-06-04

4. Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry;European Journal of Operational Research;2023-04

5. An iterated greedy algorithm for the planning of yarn‐dyeing boilers;International Transactions in Operational Research;2022-11-15