Smith, R. D.; Dudek, R. A. A general algorithm for solution of the n-job, M-machine sequencing problem of the flow shop. Errata. (English) Zbl 0206.22101 Oper. Res. 17, 756 (1969). MSC: 90B22 PDF BibTeX XML Cite \textit{R. D. Smith} and \textit{R. A. Dudek}, Oper. Res. 17, 756 (1969; Zbl 0206.22101) Full Text: DOI OpenURL
Kabak, I. W. System availability and some design implications. (English) Zbl 0184.23404 Oper. Res. 17, 827-837 (1969). PDF BibTeX XML Cite \textit{I. W. Kabak}, Oper. Res. 17, 827--837 (1969; Zbl 0184.23404) Full Text: DOI OpenURL
Henderson, W. GI/M/ priority queue. (English) Zbl 0184.23401 Oper. Res. 17, 907-910 (1969). PDF BibTeX XML Cite \textit{W. Henderson}, Oper. Res. 17, 907--910 (1969; Zbl 0184.23401) Full Text: DOI OpenURL
Odoni, A. R. On finding the maximal gain for Markov decision processes. (English) Zbl 0184.23202 Oper. Res. 17, 857-860 (1969). PDF BibTeX XML Cite \textit{A. R. Odoni}, Oper. Res. 17, 857--860 (1969; Zbl 0184.23202) Full Text: DOI OpenURL
Lippman, S. A. Criterion equivalence in dicrete dynamic programming. (English) Zbl 0184.23201 Oper. Res. 17, 920-923 (1969). PDF BibTeX XML Cite \textit{S. A. Lippman}, Oper. Res. 17, 920--923 (1969; Zbl 0184.23201) Full Text: DOI OpenURL
Garfinkel, R. S.; Nemhauser, G. L. The set-partitioning problem: Set covering with equality constraints. (English) Zbl 0184.23101 Oper. Res. 17, 848-856 (1969). PDF BibTeX XML Cite \textit{R. S. Garfinkel} and \textit{G. L. Nemhauser}, Oper. Res. 17, 848--856 (1969; Zbl 0184.23101) Full Text: DOI OpenURL
Paviani, D. A.; Himmelblau, D. M. Constrained nonlinear optimization by heuristic programming. (English) Zbl 0184.23003 Oper. Res. 17, 872-882 (1969). PDF BibTeX XML Cite \textit{D. A. Paviani} and \textit{D. M. Himmelblau}, Oper. Res. 17, 872--882 (1969; Zbl 0184.23003) Full Text: DOI OpenURL
Gould, F. J.; Pashner, H. Closure of the right-hand-side set for systems of nonlinear inequalities. (English) Zbl 0184.23002 Oper. Res. 17, 883-887 (1969). PDF BibTeX XML Cite \textit{F. J. Gould} and \textit{H. Pashner}, Oper. Res. 17, 883--887 (1969; Zbl 0184.23002) Full Text: DOI OpenURL
Washburn, A. Probability density of a moving particle. (English) Zbl 0184.21203 Oper. Res. 17, 861-871 (1969). PDF BibTeX XML Cite \textit{A. Washburn}, Oper. Res. 17, 861--871 (1969; Zbl 0184.21203) Full Text: DOI OpenURL
Ross, S. M. A problem in optimal search and stop. (English) Zbl 0183.49505 Oper. Res. 17, 984-992 (1969). PDF BibTeX XML Cite \textit{S. M. Ross}, Oper. Res. 17, 984--992 (1969; Zbl 0183.49505) Full Text: DOI Link OpenURL
Balas, Egon Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. (English) Zbl 0183.49404 Oper. Res. 17, 941-957 (1969). PDF BibTeX XML Cite \textit{E. Balas}, Oper. Res. 17, 941--957 (1969; Zbl 0183.49404) Full Text: DOI OpenURL
Rao, S. Subba; Jaiswal, N. K. On a class of queuing problems and discrete transforms. (English) Zbl 0183.49302 Oper. Res. 17, 1062-1076 (1969). PDF BibTeX XML Cite \textit{S. S. Rao} and \textit{N. K. Jaiswal}, Oper. Res. 17, 1062--1076 (1969; Zbl 0183.49302) Full Text: DOI OpenURL
Adiri, I.; Avi-Itzhak, B. A time-sharing model with many queues. (English) Zbl 0183.49301 Oper. Res. 17, 1077-1089 (1969). PDF BibTeX XML Cite \textit{I. Adiri} and \textit{B. Avi-Itzhak}, Oper. Res. 17, 1077--1089 (1969; Zbl 0183.49301) Full Text: DOI OpenURL
Celebilier, M. I. A probabilistic approach to solving assignment problems. (English) Zbl 0183.49203 Oper. Res. 17, 993-1004 (1969). PDF BibTeX XML Cite \textit{M. I. Celebilier}, Oper. Res. 17, 993--1004 (1969; Zbl 0183.49203) Full Text: DOI OpenURL
Jensen, R. E. A dynamic programming algorithm for cluster analysis. (English) Zbl 0183.49103 Oper. Res. 17, 1034-1057 (1969). PDF BibTeX XML Cite \textit{R. E. Jensen}, Oper. Res. 17, 1034--1057 (1969; Zbl 0183.49103) Full Text: DOI OpenURL
Desler, J. F.; Hakimi, S. L. A groph-theoretic approach to a class of integer-programming problems. (English) Zbl 0183.49006 Oper. Res. 17, 1017-1033 (1969). PDF BibTeX XML Cite \textit{J. F. Desler} and \textit{S. L. Hakimi}, Oper. Res. 17, 1017--1033 (1969; Zbl 0183.49006) Full Text: DOI OpenURL
Kowalik, J.; Osborne, M. R.; Ryan, D. M. A new method for constrained optimization problems. (English) Zbl 0183.49005 Oper. Res. 17, 973-983 (1969). PDF BibTeX XML Cite \textit{J. Kowalik} et al., Oper. Res. 17, 973--983 (1969; Zbl 0183.49005) Full Text: DOI OpenURL
Pakes, A. G. Some conditions for ergodicity and recurrence of Markov chains. (English) Zbl 0183.46902 Oper. Res. 17, 1058-1061 (1969). PDF BibTeX XML Cite \textit{A. G. Pakes}, Oper. Res. 17, 1058--1061 (1969; Zbl 0183.46902) Full Text: DOI OpenURL
Simmons, D. M. One-dimensional space allocation: An ordering algorithm. (English) Zbl 0182.53304 Oper. Res. 17, 812-826 (1969). PDF BibTeX XML Cite \textit{D. M. Simmons}, Oper. Res. 17, 812--826 (1969; Zbl 0182.53304) Full Text: DOI OpenURL
Reiter, Raymond On assembly-line balancing problems. (English) Zbl 0176.50101 Oper. Res. 17, No. 4, 685-700 (1969). MSC: 90B35 PDF BibTeX XML Cite \textit{R. Reiter}, Oper. Res. 17, 685--700 (1969; Zbl 0176.50101) Full Text: DOI OpenURL
Emmons, Hamilton One-machine sequencing to minimize certain functions of job tardiness. (English) Zbl 0176.50005 Oper. Res. 17, 701-715 (1969). PDF BibTeX XML Cite \textit{H. Emmons}, Oper. Res. 17, 701--715 (1969; Zbl 0176.50005) Full Text: DOI OpenURL
Schweitzer, P. J. Perturbation theory and undiscounted Markov renewal programming. (English) Zbl 0176.50003 Oper. Res. 17, 716-727 (1969). PDF BibTeX XML Cite \textit{P. J. Schweitzer}, Oper. Res. 17, 716--727 (1969; Zbl 0176.50003) Full Text: DOI OpenURL
Morton, T. E. A critique of the Norman-White dynamic programming approximation. (English) Zbl 0176.50001 Oper. Res. 17, 751-752 (1969). PDF BibTeX XML Cite \textit{T. E. Morton}, Oper. Res. 17, 751--752 (1969; Zbl 0176.50001) Full Text: DOI OpenURL
Hillier, F. S. A bound-and-scan algorithm for pure integer linear programming with general variables. (English) Zbl 0176.49904 Oper. Res. 17, 638-679 (1969). PDF BibTeX XML Cite \textit{F. S. Hillier}, Oper. Res. 17, 638--679 (1969; Zbl 0176.49904) Full Text: DOI OpenURL
Krolak, P. D. Computational results of an integer programming algorithm. (English) Zbl 0176.49903 Oper. Res. 17, 743-749 (1969). PDF BibTeX XML Cite \textit{P. D. Krolak}, Oper. Res. 17, 743--749 (1969; Zbl 0176.49903) Full Text: DOI OpenURL
Hillier, F. S. Efficient heuristic procedures for integer linear programming with an interior. (English) Zbl 0176.49902 Oper. Res. 17, 600-637 (1969). PDF BibTeX XML Cite \textit{F. S. Hillier}, Oper. Res. 17, 600--637 (1969; Zbl 0176.49902) Full Text: DOI OpenURL
Raghavachari, M. On connections between zero-one integer programming and concave programming under linear constraints. (English) Zbl 0176.49805 Oper. Res. 17, 680-684 (1969). PDF BibTeX XML Cite \textit{M. Raghavachari}, Oper. Res. 17, 680--684 (1969; Zbl 0176.49805) Full Text: DOI OpenURL
Frank, H. Shortest paths in probabilistic graphs. (English) Zbl 0176.48301 Oper. Res. 17, 583-599 (1969). PDF BibTeX XML Cite \textit{H. Frank}, Oper. Res. 17, 583--599 (1969; Zbl 0176.48301) Full Text: DOI OpenURL
Burke, P. J. The dependence of sojourn times in tandem M/M/s queues. (English) Zbl 0176.48001 Oper. Res. 17, 754 (1969). PDF BibTeX XML Cite \textit{P. J. Burke}, Oper. Res. 17, 754 (1969; Zbl 0176.48001) Full Text: DOI OpenURL
Schrage, L. A mixed-priority queue with applications to the analysis of real-time systems. (English) Zbl 0176.47903 Oper. Res. 17, 728-742 (1969). PDF BibTeX XML Cite \textit{L. Schrage}, Oper. Res. 17, 728--742 (1969; Zbl 0176.47903) Full Text: DOI OpenURL
Veinott, Arthur F. jun. Minimum concave-cost solution of Leontief substitution models of multi- facility inventory systems. (English) Zbl 0175.17602 Oper. Res. 17, 262-291 (1969). Reviewer: K. Ackermann MSC: 90B05 90C39 PDF BibTeX XML Cite \textit{A. F. Veinott jun.}, Oper. Res. 17, 262--291 (1969; Zbl 0175.17602) Full Text: DOI OpenURL
Fishburn, P. C. Information analysis without states of the world. (English) Zbl 0174.21802 Oper. Res. 17, 413-424 (1969). PDF BibTeX XML Cite \textit{P. C. Fishburn}, Oper. Res. 17, 413--424 (1969; Zbl 0174.21802) Full Text: DOI OpenURL
Nair, S. S.; Neuts, M. F. A priority rule based on the ranking of the service times for the M/G/1 queue. (English) Zbl 0174.21501 Oper. Res. 17, 466-477 (1969). PDF BibTeX XML Cite \textit{S. S. Nair} and \textit{M. F. Neuts}, Oper. Res. 17, 466--477 (1969; Zbl 0174.21501) Full Text: DOI OpenURL
Geoffrion, A. M. An improved implicit enumeration approach for integer programming. (English) Zbl 0174.20801 Oper. Res. 17, 437-454 (1969). MSC: 65K05 90C10 PDF BibTeX XML Cite \textit{A. M. Geoffrion}, Oper. Res. 17, 437--454 (1969; Zbl 0174.20801) Full Text: DOI OpenURL
Roth, R. Computer solutions to minimum-cover problems. (English) Zbl 0174.20706 Oper. Res. 17, 455-465 (1969). MSC: 65K05 90C10 65Y10 PDF BibTeX XML Cite \textit{R. Roth}, Oper. Res. 17, 455--465 (1969; Zbl 0174.20706) Full Text: DOI OpenURL
Owen, G. Minimization of fatalities in a nuclear attack model. (English) Zbl 0172.44802 Oper. Res. 17, 489-505 (1969). PDF BibTeX XML Cite \textit{G. Owen}, Oper. Res. 17, 489--505 (1969; Zbl 0172.44802) Full Text: DOI OpenURL
Sweat, C. W. A duel involving false targets. (English) Zbl 0172.44702 Oper. Res. 17, 478-488 (1969). PDF BibTeX XML Cite \textit{C. W. Sweat}, Oper. Res. 17, 478--488 (1969; Zbl 0172.44702) Full Text: DOI OpenURL
Dreyfus, S. E. An appraisal of some shortest-path algorithms. (English) Zbl 0172.44202 Oper. Res. 17, 395-412 (1969). MSC: 90B10 90C35 PDF BibTeX XML Cite \textit{S. E. Dreyfus}, Oper. Res. 17, 395--412 (1969; Zbl 0172.44202) Full Text: DOI OpenURL
Hammer, P. L.; Rudeanu, S. Pseudo-Boolean programming. (English) Zbl 0172.43903 Oper. Res. 17, 233-261 (1969). PDF BibTeX XML Cite \textit{P. L. Hammer} and \textit{S. Rudeanu}, Oper. Res. 17, 233--261 (1969; Zbl 0172.43903) Full Text: DOI OpenURL
Reklaitic, G.; Wilde, D. J. A computationally compact sufficient condition for constrained minima. (English) Zbl 0172.43803 Oper. Res. 17, 425-436 (1969). PDF BibTeX XML Cite \textit{G. Reklaitic} and \textit{D. J. Wilde}, Oper. Res. 17, 425--436 (1969; Zbl 0172.43803) Full Text: DOI OpenURL
Walker, Warren E. A method for obtaining the optimal dual solution to a linear program using the Dantzig-Wolfe decomposition. (English) Zbl 0172.43502 Oper. Res. 17, 368-370 (1969). MSC: 90C05 PDF BibTeX XML Cite \textit{W. E. Walker}, Oper. Res. 17, 368--370 (1969; Zbl 0172.43502) Full Text: DOI OpenURL
Brosh, I. Preemptive priority assignment in multichannel systems. (English) Zbl 0172.21804 Oper. Res. 17, 526-535 (1969). PDF BibTeX XML Cite \textit{I. Brosh}, Oper. Res. 17, 526--535 (1969; Zbl 0172.21804) Full Text: DOI OpenURL
Enns, E. G. Some waiting-time distributions for queues with multiple feedback and priorities. (English) Zbl 0172.21803 Oper. Res. 17, 519-525 (1969). PDF BibTeX XML Cite \textit{E. G. Enns}, Oper. Res. 17, 519--525 (1969; Zbl 0172.21803) Full Text: DOI OpenURL
Delbrouck, L. E. N. A multiserver queue with enforced idle times. (English) Zbl 0172.21802 Oper. Res. 17, 506-518 (1969). PDF BibTeX XML Cite \textit{L. E. N. Delbrouck}, Oper. Res. 17, 506--518 (1969; Zbl 0172.21802) Full Text: DOI OpenURL
Durr, L. A single-server priority queuing system with general holding times, Poisson input. and reverse-order-of-arrival queuing discipline. (English) Zbl 0172.21702 Oper. Res. 17, 351-358 (1969). PDF BibTeX XML Cite \textit{L. Durr}, Oper. Res. 17, 351--358 (1969; Zbl 0172.21702) Full Text: DOI OpenURL
Bhattacharyya, M. N. Optimum allocation of stand-by systems. (English) Zbl 0169.51702 Oper. Res. 17, 337-343 (1969). PDF BibTeX XML Cite \textit{M. N. Bhattacharyya}, Oper. Res. 17, 337--343 (1969; Zbl 0169.51702) Full Text: DOI OpenURL
Zionts, S. Toward a unifying theory for integer linear programming. (English) Zbl 0169.51305 Oper. Res. 17, 359-367 (1969). PDF BibTeX XML Cite \textit{S. Zionts}, Oper. Res. 17, 359--367 (1969; Zbl 0169.51305) Full Text: DOI OpenURL
Pierce, Donald A.; Folks, J. Leroy Sensitivity of Bayes procedures to the prior distributions. (English) Zbl 0169.50002 Oper. Res. 17, 344-350 (1969). PDF BibTeX XML Cite \textit{D. A. Pierce} and \textit{J. L. Folks}, Oper. Res. 17, 344--350 (1969; Zbl 0169.50002) Full Text: DOI OpenURL
Lippman, S. A. Planning-horizon theorems for knapsack and renewal problems with a denumerable number of activities. (English) Zbl 0165.54302 Oper. Res. 17, 163-174 (1969). PDF BibTeX XML Cite \textit{S. A. Lippman}, Oper. Res. 17, 163--174 (1969; Zbl 0165.54302) Full Text: DOI OpenURL
Spielberg, K. Algorithms for the simple plant-location problem with some side conditions. (English) Zbl 0165.54104 Oper. Res. 17, 85-111 (1969). PDF BibTeX XML Cite \textit{K. Spielberg}, Oper. Res. 17, 85--111 (1969; Zbl 0165.54104) Full Text: DOI OpenURL
Russell, E. J. Extension of Dantzig’s algorithm to finding an initial near-optimal basis for the transportation problem. (English) Zbl 0165.54102 Oper. Res. 17, 187-191 (1969). PDF BibTeX XML Cite \textit{E. J. Russell}, Oper. Res. 17, 187--191 (1969; Zbl 0165.54102) Full Text: DOI OpenURL
Sengupta, J. K. Safety-first rules under chance-constrained linear programming. (English) Zbl 0165.53902 Oper. Res. 17, 112-132 (1969). PDF BibTeX XML Cite \textit{J. K. Sengupta}, Oper. Res. 17, 112--132 (1969; Zbl 0165.53902) Full Text: DOI OpenURL
Nash, Robert T. Event classification. (English) Zbl 0165.53603 Oper. Res. 17, 70-84 (1969). PDF BibTeX XML Cite \textit{R. T. Nash}, Oper. Res. 17, 70--84 (1969; Zbl 0165.53603) Full Text: DOI OpenURL
Sobel, M. J. Optimal average-cost policy for a queue with start-up and shut-down costs. (English) Zbl 0165.52804 Oper. Res. 17, 145-162 (1969). PDF BibTeX XML Cite \textit{M. J. Sobel}, Oper. Res. 17, 145--162 (1969; Zbl 0165.52804) Full Text: DOI OpenURL
Heathcote, C. R.; Winer, P. An approximation for the moments of waiting time. (English) Zbl 0165.52801 Oper. Res. 17, 175-186 (1969). PDF BibTeX XML Cite \textit{C. R. Heathcote} and \textit{P. Winer}, Oper. Res. 17, 175--186 (1969; Zbl 0165.52801) Full Text: DOI OpenURL