Epistemology

Maximum flow problem

Reliability (semiconductor)

Philosophy

Power (physics)

Diophantine equation

Geometry

Partition (number theory)

Combinatorics

Physics

Mathematics

Mathematical optimization

Enumeration

Flow (mathematics)

Quantum mechanics

Flow network

Computer science

Algorithm

Discrete mathematics

Simple (philosophy)

State (computer science)

Reliability Engineering & System Safety

Multi-state minimal paths, called d-minimal paths (d-MPs), are a popular tool for computing the reliability of multi-state flow networks. Most of the …

Finding all multi-state minimal paths of a multi-state flow network via feasible circulations