Solving robust bin-packing problems with a branch-and-price approach

Author:

Schepler XavierORCID,Rossi André,Gurevsky Evgeny,Dolgui Alexandre

Publisher

Elsevier BV

Subject

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

Reference42 articles.

1. Rounding and propagation heuristics for mixed integer programming;Achterberg,2012

2. On the cutting stock problem under stochastic demand;Alem;Annals of Operations Research,2010

3. A branch-and-price-and-cut approach for sustainable crop rotation planning;Alfandari;European Journal of Operational Research,2015

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

5. A taxonomy of line balancing problems and their solution approaches;Battaïa;International Journal of Production Economics,2013

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

1. Tighter bounds for the harmonic bin packing algorithm;European Journal of Operational Research;2024-07

2. A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty;European Journal of Operational Research;2024-03

3. One-dimensional stock cutting resilient against singular random defects;Computers & Operations Research;2023-09

4. Metaheuristics for Finding the Stability Radius in the Bilevel Facility Location and Uniform Pricing Problem;2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS);2023-08-14

5. Cutting and packing problems under uncertainty: literature review and classification framework;International Transactions in Operational Research;2023-05-23

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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