An asymptotically optimal algorithm for online stacking-Reference-Cited by-同舟云学术

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

An asymptotically optimal algorithm for online stacking

Published:2023-01-05 Issue:2 Volume:97 Page:161-178
ISSN:1432-2994
Container-title:Mathematical Methods of Operations Research
language:en
Short-container-title:Math Meth Oper Res

Author:

Olsen Martin^ORCID,Andersen Lars Nørvang^ORCID,Gross Allan^ORCID

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Mathematics,Software

Link

https://link.springer.com/content/pdf/10.1007/s00186-022-00808-7.pdf

Reference18 articles.

1. Aldous D, Diaconis P (1999) Longest increasing subsequences: from patience sorting to the Baik–Deift–Johansson theorem. Bull Am Math Soc 36:413–432

2. Avriel M, Penn M, Shpirer N (2000) Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discrete Appl Math 103(1–3):271–279

3. Baik J, Deift P, Johansson K (1999) On the distribution of the length of the longest increasing subsequence of random permutations. J Am Math Soc 12(4):1119–1178

4. Borgman B, van Asperen E, Dekker R (2010) Online rules for container stacking. OR Spect 32(3):687–716

5. Cornelsen S, Stefano GD (2007) Track assignment. J Discrete Algorithms 5(2):250–261

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

1. On the Online Container Stacking Inside Intermodal Terminals;Advances in Logistics, Operations, and Management Science;2023-07-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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