Flow Networks and Combinatorial Operations Research
From MaRDI portal
Cited in
(8)- Microcomputer-based algorithms for large scale shortest path problems
- Blocking systems of a graph and intersection-union interchange equality in bottleneck problems involving sets and fuzzy sets
- Optimal scheduling for two-processor systems
- An improved version of the out-of-kilter method and a comparative study of computer codes
- Packing countably many branchings with prescribed root-sets in infinite digraphs
- Some problems in discrete optimization
- Operational Research in the Wine Supply Chain
- Modules and PQ-trees in Robinson spaces
This page was built for publication: Flow Networks and Combinatorial Operations Research
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5555419)