Finding an Optimal Proximity Bound in a Very Special Scenario
Author:
Affiliation:
1. Department of Mathematics London School of Economics and Political Science London, UK
Publisher
World Scientific and Engineering Academy and Society (WSEAS)
Subject
General Mathematics
Reference14 articles.
1. Iskander Aliev, Marcel Celaya, Martin Henk, and Aled Williams. Distance-sparsity transference for vertices of corner polyhedra. SIAM Journal on Optimization, 31(1):200–216, 2021.
2. Iskander Aliev, Martin Henk, and Timm Oertel. Distances to lattice points in knapsack polyhedra. Mathematical Programming, 2019.
3. Marcel Celaya, Stefan Kuhlmann, Joseph Paat, and Robert Weismantel. Improving the cook et al. proximity bound given integral valued constraints. In Karen Aardal and Laura Sanita, editors, ` Integer Programming and Combinatorial Optimization, pages 84–97, Cham, 2022. Springer International Publishing.
4. William Cook, Albertus M H Gerards, Alexander Schrijver, and Eva Tar- ´ dos. Sensitivity theorems in integer linear programming. Mathematical Programming, 34(3):251–264, 1986.
5. Friedrich Eisenbrand and Robert Weismantel. Proximity results and faster algorithms for integer programming using the steinitz lemma. ACM Transactions on Algorithms (TALG), 16(1):1–14, 2019.
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3