A fully polynomial time approximation scheme for minimum cost-reliability ratio problems-Reference-Cited by-同舟云学术

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

A fully polynomial time approximation scheme for minimum cost-reliability ratio problems

Published:1992-01 Issue:2 Volume:35 Page:143-155
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Katoh N.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference25 articles.

1. Minimum cost-reliability ratio path problem;Ahuja;Comput. Oper. Res.,1988

2. Ratio dynamic programs;Aneja;Oper. Res. Lett.,1984

3. The theory of linear forms in logarithms;Baker,1977

4. The complexity of some problems in parametric linear and combinatorial programming;Carstensen,1983

5. Minimum ratio spanning trees;Chandrasekaran;Networks,1977

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

1. On the complexity and approximation of the maximum expected value all-or-nothing subset;Discrete Applied Mathematics;2020-09

2. Maximum probabilistic all-or-nothing paths;European Journal of Operational Research;2020-05

3. Fractional Combinatorial Optimization;Handbook of Combinatorial Optimization;2013

4. Approximating a class of combinatorial problems with rational objective function;Mathematical Programming;2010-05-08

5. Approximating Rational Objectives Is as Easy as Approximating Linear Ones;Algorithm Theory – SWAT 2006;2006

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP