Finding Equivalent Network Formulations for Constrained Network Problems

DOI10.1287/MNSC.23.7.737MaRDI QIDQ4127665zbMATH OpenOpenAlexFDO

Authors Darwin D. Klingman

Publication date 1977

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/f6be112a619be3b9373c8b867a3509703e08ba96

Mathematics Subject Classification ID

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

Cited in

(5)

• Detecting embedded pure network structures in LP problems
• On the equivalence of constrained and unconstrained flows
• A novel approach to subgraph selection with multiple weights on arcs
• Determinacy in Linear Systems and Networks
• A specialized network simplex algorithm for the constrained maximum flow problem

This page was built for publication: Finding Equivalent Network Formulations for Constrained Network Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4127665)