Flows on hypergraphs

DOI10.1007/BF02614371MaRDI QIDQ1373748zbMATH OpenFDO

Authors Riccardo Cambini, Giorgio Gallo, Maria Grazia Scutellà

Publication date 25 November 1997

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

directed hypergraphscapacitated minimum cost flownetwork simplex algorithmsspanning hypertrees

Mathematics Subject Classification ID

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

Recommendations

• Flows on hypermaps
• Matchings and flows in hypergraphs
• scientific article; zbMATH DE number 3968280
• Flows on graphs and dynamical systems
• Flow hypergraph reducibility
• Flow Hypergraph Reducibility
• On flows in bidirected graphs
• Flows of locally finite graphs
• The algebra of flows in graphs
• Flows on the join of two graphs

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 4094876 (Why is no real title available?)
• scientific article; zbMATH DE number 3791941 (Why is no real title available?)
• scientific article; zbMATH DE number 3495849 (Why is no real title available?)
• Directed hypergraphs and applications
• Extreme points of Leontief substitution systems
• Gainfree Leontief substitution flow problems
• Graph Algorithms for Functional Dependency Manipulation
• Network flows. Theory, algorithms, and applications.

Cited in

(14)

• Facets of the stochastic network flow problem
• Duality in convex minimum cost flow problems on infinite networks and hypernetworks
• Hypergraph analysis based on a compatible tensor product structure
• A hypergraph network simplex algorithm
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
• The hypergraph assignment problem
• Flows and parity subgraphs of graphs with large odd-edge-connectivity
• Max Horn SAT and the minimum cut problem in directed hypergraphs
• Integrated optimization of strategic and tactical planning decisions in forestry
• Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
• Matchings and flows in hypergraphs
• Minimum spanning hypertrees
• A note on minimum makespan assembly plans
• Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard

This page was built for publication: Flows on hypergraphs

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