default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 1
Volume 1, Number 1, October 1981
- George L. Nemhauser:
Editorial. 1 - J. David Fuller, Sandra L. Schwartz, William T. Ziemba:
Is energy self sufficiency a realistic goal for Canada? 2-5 - Leon S. Lasdon, P. O. Beck:
Scaling nonlinear programs. 6-9 - Derek W. Bunn:
An empirical Bayes procedure for the credit granting decision. 10-12 - Eliane A. Gattass, George L. Nemhauser:
An application of vertex packing to data analysis in the evaluation of pavement deterioration. 13-17 - Ellis L. Johnson, Manfred W. Padberg:
A note of the knapsack problem with special ordered sets. 18-22 - Martin Grötschel, William R. Pulleyblank:
Weakly bipartite graphs and the Max-cut problem. 23-27 - William R. Pulleyblank:
Total dual integrality and b-matchings. 28-30 - George B. Kleindorfer, Gary A. Kochenberger, Edward T. Reutzel:
Computing inter-site distances for routing and scheduling problems. 31-33 - Eitan Zemel:
On search over rationals. 34-38 - Jean B. Lasserre:
An economic interpretation of exact penalty functions using sensitivity analysis. 39-40
Volume 1, Number 2, April 1982
- George B. Dantzig:
Reminiscences about the origins of linear programming. 43-48 - Richard M. Karp:
Dynamic programming meets the principle of inclusion and exclusion. 49-51 - J. Carlier, A. H. G. Rinnooy Kan:
Scheduling subject to nonrenewable-resource constraints. 52-55 - T. S. Wee, Michael J. Magazine:
Assembly line balancing as generalized bin packing. 56-58 - Joseph F. Traub, Henryk Wozniakowski:
Complexity of linear programming. 59-62 - Achim Bachem, Ellis L. Johnson, Rainer Schrader
:
A characterization of minimal valid inequalities for mixed integer programs. 63-66 - Donald W. Hearn:
The gap function of a convex program. 67-71 - D. R. Robinson:
Algorithms for evaluating the dynamic allocation index. 72-74 - Lee Schruben, Radhika Kulkarni:
Some consequences of estimating parameters for the M/M/1 queue. 75-78 - Y. V. Lirov, E. M. Levich:
On the brown method of exponential smoothing. 79-81
Volume 1, Number 3, July 1982
- Steven A. Lippman, John J. McCall:
Taxation, incentives, and risk sharing. 83-84 - Roy Jonker, Ton Volgenant:
Identification of non-optimal arcs for the travelling salesman problem. 85-88 - Peter C. Fishburn:
Simplest cases of nth-degree stochastic dominance. 89-90 - David C. Heath, William L. Maxwell:
A note on the performance of limited entry queuing systems. 91-95 - Wen-Lian Hsu:
The distance-domination numbers of trees. 96-100 - R. Chandrasekaran, Santosh N. Kabadi, Katta G. Murty:
Some NP-complete problems in linear programming. 101-104 - Nimrod Megiddo:
On the complexity of the one-terminal network design problem. 105-107 - G. K. Agrafiotis:
A stochastic model for cell survival after irradiation. 108-110 - R. Chandrasekaran:
The weighted euclidean 1-center problem. 111-112 - J. J. Brennan:
Minimal spanning trees and partial sorting. 113-116 - Byong-Hun Ahn:
A Gauss-Seidel iteration method for nonlinear variational inequality problems over rectangles. 117-120
Volume 1, Number 4, September 1982
- John J. Bartholdi III, Loren K. Platzman:
An O(N log N) planar travelling salesman heuristic based on spacefilling curves. 121-125 - Terrence E. Daniel, Henry M. Goldberg:
A note on the economics of exhaustible resources under production capacity constraints. 126-128 - Francis J. Nourie, Enrique R. Venta:
An upper bound on the number of cuts needed in Gomory's method of integer forms. 129-133 - Martin Farber:
Independent domination in chordal graphs. 134-138 - Gérard Cornuéjols, David Hartvigsen, William R. Pulleyblank:
Packing subgraphs in a graph. 139-143 - Irwin Greenberg:
The effect of deception on optimal decisions. 144-147 - Suresh P. Sethi, N. A. Derzko, John P. Lehoczky:
Mathematical analysis of the Miller-Modigliani theory. 148-152 - Andrew F. Seila:
Multivariate estimation in regenerative simulation. 153-156 - Herbert W. Corley, David Y. Sha:
Most vital links and nodes in weighted networks. 157-160 - Eugene L. Lawler, Michael George Luby, Vijay V. Vazirani:
Scheduling open shops with parallel machines. 161-164
Volume 1, Number 5, November 1982
- Ward Whitt:
Refining diffusion approximations for queues. 165-169 - Massimo Ancona, Leila De Floriani:
Computational algorithms for hierarchically structured project networks. 170-176 - Chris N. Potts, Luk N. Van Wassenhove:
A decomposition algorithm for the single machine total tardiness problem. 177-181 - Gary A. Kochenberger, Victor H. Richard:
A simple, all primal branch and bound approach to pure and mixed integer binary programs. 182-185 - Horst W. Hamacher:
An O(K·n4) algorithm for finding the k best cuts in a network. 186-189 - John J. Bartholdi III:
A good submatrix is hard to find. 190-193 - Nimrod Megiddo, Arie Tamir:
On the complexity of locating linear facilities in the plane. 194-197 - Gennady Samorodnitsky, Ishay Weissman, Reuven Y. Rubinstein:
An efficient mixture method. 198-200 - Hoon Liong Ong:
Approximate algorithms for the travelling purchaser problem. 201-205
Volume 1, Number 6, December 1982
- Eugene L. Lawler:
A fully polynomial approximation scheme for the total tardiness problem. 207-208 - Ward Whitt:
The marshall and stoyan bounds for IMRL/G/1 queues are tight. 209-213 - Gerard J. Chang, George L. Nemhauser:
R-domination on block graphs. 214-218 - Harish C. Bahl, Stanley Zionts:
A noniterative multiproduct multiperiod production planning method. 219-221 - Robert G. Sargent, J. George Shanthikumar:
Cyclic regenerative method of simulation. 222-229 - Peter C. Bell:
The use of decomposition techniques for the analysis of open restricted queuing networks. 230-235 - Gustav Feichtinger:
Optimal pricing in a diffusion model with concave price-dependent market potential. 236-240 - Heinz Roland Weistroffer:
Multiple criteria decision making with interactive over-achievement programming. 241-245 - Hans Ziegler:
Solving certain singly constrained convex optimization problems in production planning. 246-252 - J. H. Kim, Y. H. Kim, C. J. Park:
A modified Markov model for the estimation of computer software performance. 253-257
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
