A compact linear programming formulation of the maximum concurrent flow problem

Author:

Dong Yuanyuan1,Olinick Eli V.1,Jason Kratz T.2,Matula David W.3

Affiliation:

1. Department of Engineering Management, Information, and Systems, Bobby B. Lyle School of Engineering; Southern Methodist University; Dallas Texas 75275

2. Epic, 1979 Milky Way Verona; Wisconsin 53593

3. Department of Computer Science and Engineering, Bobby B. Lyle; School of Engineering, Southern Methodist University; Dallas Texas 75275

Funder

Office of Naval Research

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference29 articles.

1. “Maximum flow routing with weighted max-min fairness,” Quality of service in the emerging networking panorama;Allalouf;J. Sol-Pareta

2. Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation;Allalouf;IEEE/ACM Trans Netw,2008

3. An incremental procedure for improving path assignment in a telecommunications network;Allen;J Heuristics,2003

4. Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem;Bienstock;Math Program, Ser B,2002

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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