On the equivalence of constrained and unconstrained flows

DOI10.1016/0166-218X(94)90003-5zbMath0830.90045MaRDI QIDQ1339398

Frieda Granot, Gautier, Antoine

Publication date: 1 December 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear-time algorithmminimum-cost linear flowsingle side constraint

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Network flow problems with one side constraint: A comparison of three solution methods
• Substitutes, Complements and Ripples in Network Flows
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Converting Linear Programs to Network Problems
• A scaled reduced gradient algorithm for network flow problems with convex separable costs
• A new algorithm for solution of resistive networks involving diodes
• Finding Equivalent Network Formulations for Constrained Network Problems
• A primal algorithm for solving a capacitated network flow problem with additional linear constraints
• A product form representation of the inverse of a multicommodity cycle matrix
• Technical Note—A Class of Linear Programs Convertible to Network Problems
• Dividing a Graph into Triconnected Components
• A Parametric Analysis of a Constrained Nonlinear Inventory-production Model
• An algorithm for the blocks and cutnodes of a graph
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: On the equivalence of constrained and unconstrained flows