The following pages link to Flows on hypergraphs (Q1373748):
Displaying 11 items.
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- Max Horn SAT and the minimum cut problem in directed hypergraphs (Q1380929) (← links)
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
- Integrated optimization of strategic and tactical planning decisions in forestry (Q1751939) (← links)
- A note on minimum makespan assembly plans (Q1848367) (← links)
- The hypergraph assignment problem (Q2339846) (← links)
- A Hypergraph Network Simplex Algorithm (Q4685765) (← links)
- Facets of the Stochastic Network Flow Problem (Q5124001) (← links)
- Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard (Q6121418) (← links)
- Hypergraph analysis based on a compatible tensor product structure (Q6185980) (← links)
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks (Q6496346) (← links)
