A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
Author:
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Subject
Management Science and Operations Research,Computer Science Applications
Link
https://pubsonline.informs.org/doi/pdf/10.1287/opre.48.3.461.12439
Reference23 articles.
1. A generalization of Polyak's convergence result for subgradient optimization
2. A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
3. Dual-ascent methods for large-scale multicommodity flow problems
4. On the choice of step size in subgradient optimization
Cited by 149 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network;Computers & Operations Research;2024-05
2. Risk aversion in green energy-efficient vehicle-petrol supply chain based on C-VaR model with government intervention: a game theoretic approach;Environment, Development and Sustainability;2024-03-23
3. Separable Lagrangian Decomposition for Quasi-Separable Problems;International Series in Operations Research & Management Science;2024
4. Lagrangean relaxation algorithms for fixed-charge capacitated relay network design;Omega;2023-12
5. Freight transport using additional railcars attached to intercity passenger trains with transshipment and railcar circulation: Tabu-search-based Lagrangian heuristic;Transportation Research Part E: Logistics and Transportation Review;2023-10
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3