Flows on hypergraphs

DOI10.1007/BF02614371zbMATH Open0889.90143MaRDI QIDQ1373748FDOQ1373748

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)

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

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)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Directed hypergraphs and applications
• Title not available (Why is that?)
• Graph Algorithms for Functional Dependency Manipulation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extreme points of Leontief substitution systems
• Title not available (Why is that?)
• Gainfree Leontief substitution flow problems

Cited In (14)

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

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)