Computing efficiently the nondominated subset of a set sum-Reference-Cited by-同舟云学术

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

Computing efficiently the nondominated subset of a set sum

Published:2022-09-06 Issue: Volume: Page:
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Int Trans Operational Res

Author:

Kerbérénès Antoine¹,Vanderpooten Daniel¹,Vanpeperstraete Jean‐Michel²

Affiliation:

1. Université Paris‐Dauphine PSL Research University LAMSADE (UMR CNRS 7243) Place du Maréchal de Lattre de Tassigny Paris 75016 France

2. Naval Group Research 280 avenue Aristide Briand Bagneux 92220 France

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.13191

Reference11 articles.

1. Bicriteria transportation problem;Aneja Y.P.;Management Science,1979

2. Solving efficiently the 0–1 multi‐objective knapsack problem;Bazgan C.;Computers & Operations Research,2009

3. Fast linear expected‐time algorithms for computing maxima and convex hulls;Bentley J.L.;Algorithmica,1993

4. A Study of Global Convexity for a Multiple Objective Travelling Salesman Problem

5. Maxima‐finding algorithms for multidimensional samples: a two‐phase approach;Chen W.‐M.;Computational Geometry,2012

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

1. Efficient dominance filtering for unions and Minkowski sums of non-dominated sets;Computers & Operations Research;2024-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP