1773 | -- | 1791 | Walter J. Gutjahr, Gabriele Uchida. A branch-and-bound approach to the optimization of redundant software under failure correlation |
1793 | -- | 1806 | Jaehyun Yeo, Heesoo Lee, Sehun Kim. An efficient broadcast scheduling algorithm for TDMA ad-hoc networks |
1807 | -- | 1818 | Chung-Chi Hsieh. Smoothness in frame reduction |
1819 | -- | 1825 | Sheng-Pen Wang. On inventory replenishment with non-linear increasing demand |
1827 | -- | 1842 | Peter Chu, Patrick S. Chen. A note on inventory replenishment policies for deteriorating items in an exponentially declining market |
1843 | -- | 1858 | Wei-Chang Yeh. Search for all ::::d::::-Mincuts of a limited-flow network |
1859 | -- | 1872 | Matthew J. Katz, Klara Kedem, Michael Segal. Improved algorithms for placing undesirable facilities |
1873 | -- | 1901 | Anant Singh Jain, Sheik Meeran. A multi-level hybrid framework applied to the general flow-shop scheduling problem |
1903 | -- | 1912 | Gianpaolo Ghiani, Francesca Guerriero, Roberto Musmanno. The capacitated plant location problem with multiple facilities in the same site |
1913 | -- | 1925 | S. Reza Hejazi, Azizollah Memariani, Gholam Reza Jahanshahloo, Mohammad Mehdi Sepehri. Linear bilevel programming solution by genetic algorithm |
1927 | -- | 1939 | Yi-Kuei Lin. Two-commodity reliability evaluation for a stochastic-flow network with node failure |