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

Minimum cost flow algorithms for series-parallel networks

  • Published:1985-02 Issue:2 Volume:10 Page:117-124
  • ISSN:0166-218X
  • Container-title:Discrete Applied Mathematics
  • language:en
  • Short-container-title:Discrete Applied Mathematics

Author:

Bein Wolfgang W.,Brucker Peter,Tamir Arie

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference5 articles.

1. Network flows in trees and knapsack problems with nested constraints;Brucker,1982

2. An O(n log n)-algorithm for the minimum cost flow problem;Brucker,1984

3. Efficient algorithm for a selection problem with nested constraints and its application to a production-sales planning model;Tamir;SIAM J. Control Optimization,1980

4. Further remarks on selection problems with nested constraints;Tamir,1979

5. The recognition of series-parallel diagraphs;Valdes;SIAM J. Comput.,1982

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

1. A Note on Grid-Type Directed Acyclic Graph for Important Property of Resource Allocation Problem;Proceedings of the 6th International Conference on Combinatorics, Graph Theory, and Network Topology (ICCGANT 2022);2023

2. Integrality in the multinetwork min‐cost equal‐flow problem;Networks;2022-03-13

3. A Max-Flow Based Approach for Neural Architecture Search;Lecture Notes in Computer Science;2022

4. Robust minimum cost flow problem under consistent flow constraints;Annals of Operations Research;2021-12-28

5. A note on integral generalized flows in directed partial 2-trees;Information Processing Letters;2021-12
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3