Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem-Reference-Cited by-同舟云学术

Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem

Published:2001-01 Issue:1 Volume:8 Page:3-13
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:International Transactions in Operational Research

Author:

Amaral Andre R.S.¹,Wright Mike²

Affiliation:

1. Departamento de Informatica, Universidade Federal do Espirito Santo, Brazil,

2. Department of Management Science, Lancaster University, UK

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/1475-3995.00002

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

1. A Solution Approach to The Problem of Nesting Rectangles with Arbitrary Rotations into Containers of Irregular Convex and Non-Convex Shapes;Lecture Notes in Computer Science;2020

2. A bidirectional building approach for the 2D constrained guillotine knapsack packing problem;European Journal of Operational Research;2015-04

3. A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem;Computers & Mathematics with Applications;2013-12

4. Sequential grouping heuristic for the two-dimensional cutting stock problem with pattern reduction;International Journal of Production Economics;2013-08

5. Heuristic for two-dimensional homogeneous two-segment cutting patterns;Engineering Optimization;2013-01