Free Access

Letter to the Editor—The Maximum Capacity Route Problem

T. C. Hu
T. C. Hu
IBM Research Center, Yorktown, New York
Search for more papers by this author

T. C. Hu

IBM Research Center, Yorktown, New York

Search for more papers by this author

Published Online:1 Dec 1961https://doi.org/10.1287/opre.9.6.898

Abstract

We consider the problem of finding maximum capacity routes between all pairs of nodes in a network.

Cited by
- An optimization‐based Monte Carlo method for estimating the two‐terminal survival signature of networks with two component classes
  28 July 2024 | Naval Research Logistics (NRL), Vol. 72, No. 2
- Optimal quantum key distribution networks: capacitance versus security
  29 April 2024 | npj Quantum Information, Vol. 10, No. 1
- Musicology, Mind Palaces and Machines
  19 December 2025 | Performance Research, Vol. 29, No. 6
- Kinetic Network in Milestoning: Clustering, Reduction, and Transition Path Analysis
  17 June 2024 | Journal of Chemical Theory and Computation, Vol. 20, No. 13
- Hierarchical Correlation Clustering and Tree Preserving Embedding
- Clustering and visualization of single-cell RNA-seq data using path metrics
  29 May 2024 | PLOS Computational Biology, Vol. 20, No. 5
- Two Algorithms for the k-Widest Path Problem
  26 June 2023 | Journal of Network and Systems Management, Vol. 31, No. 3
- The continuous maximum capacity path interdiction problem
  European Journal of Operational Research, Vol. 305, No. 1
- Online learning of network bottlenecks via minimax paths
  8 November 2022 | Machine Learning, Vol. 112, No. 1
- Beam Aware Stochastic Multihop Routing for Flying Ad-hoc Networks
- Short and Wide Network Paths
  IEEE Transactions on Network Science and Engineering, Vol. 9, No. 2
- GAMIBHEAR: whole-genome haplotype reconstruction from Genome Architecture Mapping data
  8 April 2021 | Bioinformatics, Vol. 37, No. 19
- Entropy production given constraints on the energy functions
  23 September 2021 | Physical Review E, Vol. 104, No. 3
- Time-Based Node Deployment Policies for Reliable Wireless Sensor Networks
  IEEE Transactions on Reliability, Vol. 70, No. 3
- Detection of Representative Variables in Complex Systems with Interpretable Rules Using Core-Clusters
  22 February 2021 | Algorithms, Vol. 14, No. 2
- Unsupervised representation learning with Minimax distance measures
  28 July 2020 | Machine Learning, Vol. 109, No. 11
- Learning representations from dendrograms
  16 August 2020 | Machine Learning, Vol. 109, No. 9-10
- Sorting can exponentially speed up pure dynamic programming
  Information Processing Letters, Vol. 159-160
- Unveiling causal interactions in complex systems
  25 March 2020 | Proceedings of the National Academy of Sciences, Vol. 117, No. 14
- Combinatorial space of watershed hierarchies for image characterization
  Pattern Recognition Letters, Vol. 129
- References
  22 January 2019
- Marker Based Segmentation Revisited
  31 May 2019
- A Framework for a Decentralized and Self-Organized Mail Service Network
  Procedia Computer Science, Vol. 155
- Task‐specificity in focal dystonia is shaped by aberrant diversity of a functional network kernel
  27 September 2018 | Movement Disorders, Vol. 33, No. 12
- Spatiotemporal GMM for Background Subtraction with Superpixel Hierarchy
  IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 40, No. 6
- A Generalization of Block Structures in Undirected Interconnection Networks
  6 November 2018 | Journal of Interconnection Networks, Vol. 18, No. 02n03
- Influence of Professor T. C. Hu's Works on Fundamental Approaches in Layout
  25 March 2018
- Hierarchical clustering of asymmetric networks
  8 November 2017 | Advances in Data Analysis and Classification, Vol. 12, No. 1
- Efficient Approximations for Thinnest Path Problem in Grid Graph
  5 January 2018
- Routing Algorithms: Shortest Path, Widest Path, and Spanning Tree
- Bibliography
- Admissible Hierarchical Clustering Methods and Algorithms for Asymmetric Networks
  IEEE Transactions on Signal and Information Processing over Networks, Vol. 3, No. 4
- Efficient Computation of Pairwise Minimax Distance Measures
- Feature-Oriented Analysis of User Profile Completion Problem
  8 April 2017
- Propagating Maximum Capacities for Recommendation
  19 September 2017
- Building Resilience Through Risk Analysis
  3 August 2017
- Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities
  4 July 2016 | SpringerPlus, Vol. 5, No. 1
- Bottleneck capacity of random graphs for connectomics
- Causality Networks of Financial Assets
  SSRN Electronic Journal, Vol. 18
- WITHDRAWN: Joint depth map interpolation using minimax paths
  Neurocomputing, Vol. 162
- The Thinnest Path Problem
  IEEE/ACM Transactions on Networking, Vol. 23, No. 4
- Fast Minimax Path-Based Joint Depth Interpolation
  IEEE Signal Processing Letters, Vol. 22, No. 5
- Fair optimization of mesh‐connected WLAN hotspots
  19 July 2013 | Wireless Communications and Mobile Computing, Vol. 15, No. 5
- Implicit Boundary Learning for Connectomics
  21 August 2015
- A heuristic for widest edge-disjoint path pair lexicographic optimization
- On Cartesian Trees and Range Minimum Queries
  5 September 2012 | Algorithmica, Vol. 68, No. 3
- A novel method for delivering multimedia e-advertisement data base on use multi-path and multi-seed peer-to-peer-like approach
  19 October 2012 | Peer-to-Peer Networking and Applications, Vol. 7, No. 1
- Analyzing milestoning networks for molecular kinetics: Definitions, algorithms, and examples
  5 November 2013 | The Journal of Chemical Physics, Vol. 139, No. 17
- On multi-stream multi-source multicast routing
  Computer Networks, Vol. 57, No. 15
- Shortest Paths
- Spanning Trees
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
  Discrete Applied Mathematics, Vol. 160, No. 12
- Bibliography
  15 August 2011
- Minimum spanning tree adaptive image filtering
- On Cartesian Trees and Range Minimum Queries
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
  European Journal of Operational Research, Vol. 186, No. 2
- All-pairs bottleneck paths for general graphs in truly sub-cubic time
  11 June 2007
- Thek-centrum shortest path problem
  TOP, Vol. 14, No. 2
- Minimum spanning trees and random resistor networks in d dimensions
  14 September 2005 | Physical Review E, Vol. 72, No. 3
- Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
  Journal of Algorithms, Vol. 48, No. 2
- Hierarchies of Partitions and Morphological Segmentation
  22 June 2001
- Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width
  18 June 1998
- Chapter 1 Applications of network optimization
- Minimum Spanning Forests for Morphological Segmentation
- On the History of the Minimum Spanning Tree Problem
  IEEE Annals of the History of Computing, Vol. 7, No. 1
- Computational Methods for Minimum Spanning Tree Algorithms
  SIAM Journal on Scientific and Statistical Computing, Vol. 5, No. 1
- Minimax trees, paths, and cut sets
  21 November 2006 | Naval Research Logistics Quarterly, Vol. 30, No. 4
- Blocking Systems of a Graph and ∪ ∩ Interchange Equality in Bottleneck Problems Involving Sets and Fuzzy Sets
  Journal of the Franklin Institute, Vol. 314, No. 1
- Bibliography
- Easy and hard bottleneck location problems
  Discrete Applied Mathematics, Vol. 1, No. 3
- A boolean theory of network flows and metrics and its applications to particle transmission and clustering
  11 October 2006 | Networks, Vol. 9, No. 3
- Use of Floyd'S Algorithm to Find Shortest Restricted Paths
- An Implicit Enumeration Algorithm for Sequencing Policies Applied to Telephone Switching Facilities
  IEEE Transactions on Systems, Man, and Cybernetics, Vol. 8, No. 4
- Application of Sequencing Policies to Telephone Switching Facilities
  IEEE Transactions on Systems, Man, and Cybernetics, Vol. 7, No. 8
- Un algorithme efficace pour un arbre de classifications
  29 March 2011 | RAIRO - Operations Research, Vol. 11, No. 1
- Valeurs propres et vecteurs propres en classification hiérarchique
  8 January 2011 | Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Vol. 10, No. R1
- Structures algébriques généralisées des problèmes de cheminement dans les graphes
  29 March 2011 | Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle, Vol. 10, No. V2
- Survey of Deterministic Networks
  9 July 2007 | A I I E Transactions, Vol. 7, No. 3
- Survey of Deterministic Networks
  16 July 2007 | A I I E Transactions, Vol. 8, No. 1
- A Graph Theoretic Analysis of Pattern Classification via Tamura's Fuzzy Relation
  IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-4, No. 3
- Bottleneck extrema
  Journal of Combinatorial Theory, Vol. 8, No. 3
- Revised Matrix Algorithms for Shortest Paths
  SIAM Journal on Applied Mathematics, Vol. 15, No. 1
- Flow Networks and Combinatorial Operations Research
  5 February 2018 | The American Mathematical Monthly, Vol. 73, No. 2
- VII. Communication Networks
  IEEE Transactions on Circuit Theory, Vol. 11, No. 1

Volume 9, Issue 6

November-December 1961

Pages 771-925

Article Information

Metrics

Information

Published Online:December 01, 1961

Cite as

T. C. Hu, (1961) Letter to the Editor—The Maximum Capacity Route Problem. Operations Research 9(6):898-900.

https://doi.org/10.1287/opre.9.6.898

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Letter to the Editor—The Maximum Capacity Route Problem

Abstract

Volume 9, Issue 6

Article Information

Metrics

Information

Cite as

Sign Up for INFORMS Publications Updates and News