Finding Equivalent Network Formulations for Constrained Network Problems
From MaRDI portal
Publication:4127665
DOI10.1287/mnsc.23.7.737zbMath0355.90070OpenAlexW2096171298MaRDI QIDQ4127665
Publication date: 1977
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f6be112a619be3b9373c8b867a3509703e08ba96
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
On the equivalence of constrained and unconstrained flows, A novel approach to subgraph selection with multiple weights on arcs, A specialized network simplex algorithm for the constrained maximum flow problem, Determinacy in Linear Systems and Networks, Detecting embedded pure network structures in LP problems