A partitioning algorithm for the multicommodity network flow problem

DOI10.1007/BF01584987zbMath0254.90059OpenAlexW2005859793MaRDI QIDQ5668269

William W. White, Michael D. Grigoriadis

Publication date: 1972

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584987

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items

A linear model for compound multicommodity network flow problems, A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows, Unnamed Item, A minimum-cost multicommodity network flow problem concerning imports and exports, Large-scale linear programming: Geometry, working bases and factorizations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal partition programming for block diagonal matrices
• A decomposition method for structured linear and nonlinear programs
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• The Decomposition Algorithm for Linear Programs
• Minimum Concave Cost Flows in Certain Networks
• A Treatment of Transportation Problems by Primal Partition Programming
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• A Dual Generalized Upper Bounding Technique
• A generalized upper bounding algorithm for multicommodity network flow problems
• Multi-Commodity Network Flows
• Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming