A three‐stage p ‐median based exact method for the optimal diversity management problem
Author:
Affiliation:
1. University” Federico II” of NaplesNapoli80125Italy
2. Matrosov Institute for System Dynamics and Control Theory, Siberian Branch of the Russian Academy of SciencesIrkutsk664033Russia
Funder
University “Federico II” of Naples, “MOSTLOG” (A Multi-Objective approach for SusTainable LOGistic System)
Publisher
Wiley
Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Link
https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.21821
Reference42 articles.
1. Solving huge size instances of the optimal diversity management problem
2. Using decomposition to improve greedy solutions of the optimal diversity management problem
3. A decomposition approach for the p -median problem on disconnected graphs
4. The linking set problem: a polynomial special case of the multiple-choice knapsack problem
5. Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems
Cited by 15 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The balanced p-median problem with unitary demand;Computers & Operations Research;2023-07
2. Optimizing Dental Implant Distribution: A Strategic Approach for Supply Chain Management in the Beauty and Well-Being Industry;Lecture Notes in Computer Science;2023
3. A semi-Lagrangian relaxation heuristic algorithm for the simple plant location problem with order;Journal of the Operational Research Society;2022-12-05
4. The Balanced P-Median Problem;SSRN Electronic Journal;2022
5. Optimization of IEDs Position in MV Smart Grids through Integer Linear Programming;Energies;2021-06-07
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3