Naval Research Logistics Quarterly

Titel Veröffentlichungsdatum Sprache Zitate
Numerical investigations on quadratic assignment problems1978/03/01English77
The knapsack problem: A survey1975/03/01English76
Optimal interdiction policy for a flow network1971/03/01English75
An informal survey of multi‐echelon inventory theory1972/12/01English72
A general theory of measurement applications to utility1959/12/01English72
Some remarks on bayes solutions to the inventory problem1960/12/01English71
Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem1980/03/01English71
Allocation policies and cost approximations for multilocation inventory systems1984/03/01English71
A new analysis of a lot‐size model with partial backlogging1979/06/01English71
Sequencing with due‐dates and early start times to minimize maximum tardiness1974/03/01English70
The payment scheduling problem1972/03/01English70
Analysis of A time‐shared processor1964/03/01English70
A hybrid algorithm for the one machine sequencing problem to minimize total tardiness1971/09/01English69
Toward a study of bidding processes part IV ‐ games with unknown costs1967/01/01English69
Single‐ and multiple‐processor models for minimizing completion time variance1986/02/01English66
Investing in new parameter values in the discounted EOQ model1986/02/01English66
On the graphs and asymptotic forms of finite boolean relation matrices and stochastic matrices1957/06/01English64
Complements and substitutes in the opttmal assignment problem1962/03/01English64
Renewal processes of phase type1978/09/01English63
On failure modeling1985/08/01English63
Interval estimation of a global optimum for large combinatorial problems1979/03/01English63
The fixed charge problem1970/06/01English62
Investment policies for expanding businesses optimal in a long‐run sense1960/12/01English62
The enumeration of all efficient solutions for a linear multiple‐objective transportation problem1979/03/01English62
Planning horizon procedures for machine replacement models with several possible replacement alternatives1982/09/01English61
Numerical treatment of a class of semi‐infinite programming problems1973/09/01English59
Optimal policy for a dynamic multi‐echelon inventory model1966/12/01English59
An efficient heuristic for the multi‐item newsboy problem with a single constraint1984/09/01English59
Estimation in single server queues1981/09/01English59
Optimal stocking policies for low usage items in multi‐echelon inventory systems1986/02/01English58