Algorithms for the one-dimensional two-stage cutting stock problem-Reference-Cited by-同舟云学术

Algorithms for the one-dimensional two-stage cutting stock problem

Published:2018-11 Issue:1 Volume:271 Page:20-32
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Muter İbrahim^ORCID,Sezer Zeynep

Funder

Scientific and Technological Research Council of Turkey

Publisher

Elsevier BV

Subject

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

Reference38 articles.

1. Integrated location, routing and scheduling problems: Models and algorithms;Akca,2010

2. A LP-based heuristic for a time-constrained routing problem;Avella;European Journal of Operational Research,2006

3. Computational study of large-scale p-median problems;Avella;Mathematical Programming,2007

4. Branch-and-price: Column generation for solving huge integer programs;Barnhart;Operations Research,1998

5. Linear programming;Chvátal,1983

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

1. A bay design problem in less-than-unit-load production warehouse;Computers & Operations Research;2024-11

2. Solving satellite image data downlink scheduling problem with family attribute via a bi-stage differential evolutionary algorithm;Applied Soft Computing;2024-10

3. Integrated aircraft routing and cargo routing problem for combination airlines;Transportation Research Part B: Methodological;2024-10

4. An Efficient Binary Hybrid Equilibrium Algorithm for Binary Optimization Problems: Analysis, Validation, and Case Studies;International Journal of Computational Intelligence Systems;2024-04-22

5. Chaotic Binarization Schemes for Solving Combinatorial Optimization Problems Using Continuous Metaheuristics;Mathematics;2024-01-12