External Links

    Journal: Oper. Res. Lett.

    Volume 13, Issue 5

    265 -- 275Lee Schruben, Enver Yücesan. Modeling paradigms for discrete event simulation
    277 -- 285Russell A. Rushmeier, George L. Nemhauser. Experiments with parallel branch-and-bound algorithms for the set covering problem
    287 -- 293Meltem Denizel-Sivri, S. Selçuk Erengüç. A polynomial algorithm for a multi-item capacitated production planning problem
    295 -- 303Takahito Kuno. Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
    305 -- 313Roger L. Tobin, Terry L. Friesz, Nihal J. Mehta. K-K-T multiploer estimates and objective function lower bounds from projective SUMT
    315 -- 323Darko Skorin-Kapov. On a cost allocation problem arising from a capacitated concentrator covering problem
    325 -- 329Enrique Ballestero, Carlos Romero. Weighting in compromise programming: A theorem on shadow prices
    runs on