Supply chain optimization in the pulp mill industry––IP models, column generation and novel constraint branches

Author:

Bredström David,Lundgren Jan T.,Rönnqvist Mikael,Carlsson Dick,Mason Andrew

Publisher

Elsevier BV

Subject

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

Reference14 articles.

1. Integer Programming;Wolsey,1998

2. The solution of massive generalized set partitioning problems in air crew rostering;Ryan;Journal of the Operational Research Society,1997

3. Branch-And-Price: Column generation for solving huge integer programs;Barnhart;Operation Research,1998

4. An integer programming approach to scheduling;Ryan,1981

5. Computer assembly;Kilger,2000

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

1. A Spatial Equilibrium Problem for the European Pulp and Paper Industry Under the Emission Trading System;Journal of Optimization Theory and Applications;2023-09-07

2. Estimation of global waste smartphones and embedded critical raw materials: An industry life cycle perspective;Resources, Conservation and Recycling;2023-09

3. Fifty years of operational research in forestry;International Transactions in Operational Research;2023-05-18

4. Reducing the Supply-Chain Nervosity Thanks to Flexible Planning;Optimization and Decision Science: Operations Research, Inclusion and Equity;2023

5. Multi-Process Logistics Planning for Cost Minimization and Workload Balance in Steel Production Systems;2022 IEEE International Conference on Networking, Sensing and Control (ICNSC);2022-12-15

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3