咨询与建议

限定检索结果

文献类型

  • 6 篇 期刊文献
  • 1 篇 学位论文

馆藏范围

  • 7 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 4 篇 工学
    • 1 篇 仪器科学与技术
    • 1 篇 电气工程
    • 1 篇 计算机科学与技术...
    • 1 篇 软件工程
  • 4 篇 管理学
    • 4 篇 管理科学与工程(可...
  • 3 篇 理学
    • 2 篇 数学
    • 1 篇 物理学

主题

  • 7 篇 capacitated netw...
  • 2 篇 network planning
  • 1 篇 zero-one optimiz...
  • 1 篇 path set
  • 1 篇 complex adaptive...
  • 1 篇 maximum flows
  • 1 篇 decision tree
  • 1 篇 cut set
  • 1 篇 two-terminal rel...
  • 1 篇 network
  • 1 篇 multi-objective ...
  • 1 篇 gnet solution co...
  • 1 篇 agent-based mode...
  • 1 篇 critical infrast...
  • 1 篇 broadband wirele...
  • 1 篇 transformations
  • 1 篇 hop-constrained
  • 1 篇 integer programm...
  • 1 篇 heuristics
  • 1 篇 undirected multi...

机构

  • 1 篇 iowa state univ ...
  • 1 篇 george washingto...
  • 1 篇 informat sci & t...
  • 1 篇 george mason uni...
  • 1 篇 stevens inst tec...
  • 1 篇 auburn univ dept...
  • 1 篇 naval postgradua...
  • 1 篇 virginia tech pa...

作者

  • 1 篇 ibaraki t
  • 1 篇 hoffman karla
  • 1 篇 garstenauer andr...
  • 1 篇 ramirez-marquez ...
  • 1 篇 ragsdale cliff t...
  • 1 篇 nagamochi h
  • 1 篇 villa christine
  • 1 篇 gebre bethel a.
  • 1 篇 pumpuni-lenss gl...
  • 1 篇 blackburn timoth...
  • 1 篇 konak a
  • 1 篇 smith ae
  • 1 篇 scheibe kevin p.
  • 1 篇 cheong yue pui

语言

  • 7 篇 英文
检索条件"主题词=CAPACITATED NETWORKS"
7 条 记 录,以下是1-10 订阅
排序:
Resilience in Complex Systems: An Agent-Based Approach
收藏 引用
SYSTEMS ENGINEERING 2017年 第2期20卷 158-172页
作者: Pumpuni-Lenss, Gloria Blackburn, Timothy Garstenauer, Andreas George Washington Univ Sch Engn & Appl Sci Dept Engn Management & Syst Engn Washington DC 20052 USA
This paper presents results from a research project on the behavior of complex systems after they experience disruptive events that impact their performance. As systems become more complex, the probability increases t... 详细信息
来源: 评论
A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2009年 第2期197卷 773-784页
作者: Scheibe, Kevin P. Ragsdale, Cliff T. Iowa State Univ Dept Logist Operat & Management Informat Syst Ames IA 50011 USA Virginia Tech Pamplin Coll Business Blacksburg VA 24061 USA
Three critical factors in wireless mesh network design are the number of hops between supply and demand points, the bandwidth capacity of the transport media, and the technique used to route packets within the network... 详细信息
来源: 评论
A classification tree based approach for the development of minimal cut and path vectors of a capacitated network
收藏 引用
IEEE TRANSACTIONS ON RELIABILITY 2007年 第3期56卷 474-487页
作者: Ramirez-Marquez, Jose Emmanuel Gebre, Bethel A. Stevens Inst Technol Sch Syst & Enterprises Hoboken NJ 07030 USA
This paper presents a holistic method that links together Monte-Carlo simulation, exact algorithms, and a data mining technique, to develop approximate bounds on the reliability of capacitated two-terminal networks. T... 详细信息
来源: 评论
A column-generation and branch-and-cut approach to the Bandwidth-Packing Problem
收藏 引用
JOURNAL OF RESEARCH OF THE NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY 2006年 第2期111卷 161-185页
作者: Villa, Christine Hoffman, Karla George Mason Univ Syst Engn & Operat Res Dept Fairfax VA 22030 USA
The telecommunications problem of assigning calls with point to point demand to a capacitated network where each call can be assigned to at most one path has been called the Bandwidth-Packing Problem. For a given netw... 详细信息
来源: 评论
capacitated network design considering survivability: An evolutionary approach
收藏 引用
ENGINEERING OPTIMIZATION 2004年 第2期36卷 189-205页
作者: Konak, A Smith, AE Auburn Univ Dept Ind & Syst Engn Auburn AL 36849 USA Informat Sci & Technol Reading PA 19610 USA
This paper presents an evolutionary approach to design of capacitated networks considering cost, performance, and survivability. Traditionally, network performance and survivability have been considered independently.... 详细信息
来源: 评论
COMPUTING EDGE-CONNECTIVITY IN MULTIGRAPHS AND capacitated GRAPHS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 1992年 第1期5卷 54-66页
作者: NAGAMOCHI, H IBARAKI, T
Given an undirected graph G = (V, E), it is known that its edge-connectivity lambda(G) can be computed by solving O(\V\) max-flow problems. The best time bounds known for the problem are O(lambda(G)\V\2), due to Matul... 详细信息
来源: 评论
Network transformations and some applications
Network transformations and some applications
收藏 引用
作者: Cheong, Yue Pui Naval Postgraduate School
学位级别:硕士
The growing number of large scale applications of network models and the availability of very fast solution codes make it attractive to formulate problems as networks whenever such models are adequate for the purpose.... 详细信息
来源: 评论