Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems

DOI10.1002/net.3230240505zbMath0805.90042OpenAlexW2165185787MaRDI QIDQ4305123

Gautier, Antoine, Frieda Granot

Publication date: 31 January 1995

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230240505

zbMATH Keywords

sensitivity analysisminimum-cost flowone additional linear constraint

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Related Items (1)

Substitutes and complements in network flows viewed as discrete convexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A scaled reduced gradient algorithm for network flow problems with convex separable costs
• A new algorithm for solution of resistive networks involving diodes

This page was built for publication: Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems