Flows on hypergraphs
From MaRDI portal
Publication:1373748
DOI10.1007/BF02614371zbMath0889.90143MaRDI QIDQ1373748
Giorgio Gallo, Maria Grazia Scutellà, Riccardo Cambini
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (10)
Max Horn SAT and the minimum cut problem in directed hypergraphs ⋮ Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ Hypergraph analysis based on a compatible tensor product structure ⋮ Facets of the Stochastic Network Flow Problem ⋮ Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design ⋮ Integrated optimization of strategic and tactical planning decisions in forestry ⋮ A Hypergraph Network Simplex Algorithm ⋮ A note on minimum makespan assembly plans ⋮ The hypergraph assignment problem
Cites Work
This page was built for publication: Flows on hypergraphs