A solvability theorem and minimax fractional programming J. GwinnerV. Jeyakumar OriginalPaper Pages: 1 - 12
Computing steady-state queueing-time distributions of single-server queues:GI X /M/1 M. L. ChaudhryM. AgarwalJ. G. C. Templeton OriginalPaper Pages: 13 - 29
Open shop problems with unit time operations Peter BruckerBernd JurischMarion Jurisch OriginalPaper Pages: 59 - 73
Optimal compactification of a floorplan and its relation to other optimization problems-a dynamic programming approach Michael Kolonko OriginalPaper Pages: 75 - 95
The best choice problem with an unknown number of objects Aarni Lehtinen OriginalPaper Pages: 97 - 106
An integer programming formulation of the Steiner problem in graphs Mamadi DianéJán Plesník Short Note Pages: 107 - 111