- Full text PDF available (13)
We formulate a Belief Propagation (BP) algorithm in the context of the capacitated minimum-cost network flow problem (MCF). Unlike most of the instances of BP studied in the past, the messages of BP in the context of this problem are piecewise-linear functions. We prove that BP converges to the optimal solution in pseudo-polynomial time, provided that the… (More)
The long chain has been an important concept in the design of flexible processes. This design concept, as well as other sparse designs, have been applied by the automotive and other industries as a way to increase flexibility in order to better match available capacities with variable demands. Numerous empirical studies have validated the effectiveness of… (More)
The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract Distributed, iterative algorithms operating with minimal data structure while performing little computation per iteration are popularly known as message-passing in the recent literature. Belief Propagation (BP), a prototypical… (More)
We establish a convenient necessary and sufficient condition for a multiaffine real polynomial to be stable, and use it to verify that the half-plane property holds for seven small matroids that resisted the efforts of Choe, Oxley, Sokal, and Wagner . In recent years, matroid theory has found connections with certain analytic properties of real… (More)
We study a hybrid strategy that uses both process flexibility and inventory to mitigate risks of plant disruption. In this setting, a firm allocates inventory before disruption while facing demand uncertainties; demand is realized after disruption, and the firm schedules its production using process flexibility to minimize lost sales. This interplay between… (More)
Theoretical studies of process flexibility designs had mostly focused on average-case analysis. In this paper, we take a different approach by studying process flexibility designs from a worst-case point of view. To study the worst-case performances, we introduce the so-called plant cover index, an index defined by a constrained bipartite vertex cover… (More)
The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters.