An algorithm for the determination of the economic design of X̄-charts based on Duncan's model is described in this paper. This algorithm consists of solving an implicit equation in design variables n ...

The maximum-flow problem, or max flow, is one of the most basic problems in computer science. MIT researchers, together with colleagues at Yale and the University of Southern California, have ...

Algorithm promises to greatly streamline solutions to the 'max flow' problem. Research could boost the efficiency even of huge networks like the Internet. Finding the most efficient way to transport ...