A branch-and-price algorithm for the temporal bin packing problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A branch-and-price algorithm for the temporal bin packing problem

Published:2020-02 Issue: Volume:114 Page:104825
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Dell’Amico Mauro,Furini Fabio^ORCID,Iori Manuel

Funder

Ministero dell’Istruzione, dell’Università e della Ricerca

Università Degli Studi di Modena e Reggio Emila

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference57 articles.

1. A branch-and-bound algorithm for the strip packing problem;Alvarez-Valdés;OR Spectr.,2009

2. Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem;Alves;Eur. J. Oper. Res.,2014

3. Dual-optimal inequalities for stabilized column generation;Amor;Oper. Res.,2006

4. Optimal interval scheduling with a resource constraint;Angelelli;Comput. Oper. Res.,2016

5. On the complexity of interval scheduling with a resource constraint;Angelelli;Theor. Comput. Sci.,2011

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

1. Capacity planning in logistics corridors: Deep reinforcement learning for the dynamic stochastic temporal bin packing problem;Transportation Research Part E: Logistics and Transportation Review;2024-11

2. Strategies to overcome constraints in the vehicle fill rate of road freight transport for FMCG sector;Case Studies on Transport Policy;2024-09

3. A hybrid Multi-Objective Optimization Approach for Efficient 3D Container Loading Problem;2024-08-30

4. Research on truck loading problem based on combined heuristic algorithm;Proceedings of the 3rd International Conference on Computer, Artificial Intelligence and Control Engineering;2024-01-26

5. Lower and upper bounding procedures for the bin packing problem with concave loading cost;European Journal of Operational Research;2024-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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