Showing papers in "Operations Research Letters in 1982"

TL;DR: The problem of sequencing jobs on a single machine to minimize total tardiness is considered and an algorithm, which decomposes the problem into subproblems which are then solved by dynamic programming when they are sufficiently small.

TL;DR: The n most vital links (or nodes) in a weighted network are those n links (nodes) whose removal from the network results in the greatest increase in shortest distance between two specified nodes.

TL;DR: It is shown that it is NP-hard to find r lines so as to minimize any isotone function of the distances between given points and their respective nearest lines.

TL;DR: Bin packing heuristics are generalized and adapted to solve the assembly line balancing problem and the results are compared to those for a resource constrained scheduling problem considered by Garey, Graham, Johnson and Yao.

TL;DR: It is conjecture that there exists no polynomial-time algorithm for the linear inequalities problem in the real number model, and it is conjectured that linear inequalities are strictly harder than linear equalities in all ''reasonable'' models of computation.

TL;DR: It is shown that several combinatorial existence problems can be attacked by solving associated enumeration problems using a combination of dynamic programming and the principle of inclusion and exclusion.

TL;DR: The author recalls the early days of linear programming, the contributions of von Neumann, Leontief, Koopmans and others, and the results found by the simplex method.

TL;DR: The gap function expresses the duality gap of a convex program as a function of the primal variables only, differentiability and convexity properties are derived, and a convergent minimization algorithm is given.

TL;DR: The algorithm is easily coded: a complete BASIC program is included in the appendix and, since the algorithm consists essentially of sorting, points are easily added or removed.

TL;DR: This work presents a linear algorithm to locate a minimum weight independent dominating set in a chordal graph with 0-1 vertex weights.

TL;DR: A review of the experimental data available concerning ear-drum structure, properties and behaviour is presented to provide a basis for quantitative modelling and to identify areas where further information is required.

TL;DR: A fully polynomial approximation scheme is presented for the problem of sequencing jobs for processing by a single machine so as to minimize total tardiness.

TL;DR: It is shown that the problem of packing edges and triangles in a graph in order to cover the maximum number of nodes can be solved in polynomial time.

TL;DR: The role of HPV as the etiologic agent of laryngeal squamous cell papillomas is discussed, as is the potential malignant transformation of them.

TL;DR: The need to refine diffusion approximations for queues is illustrated by several different ways for the mean waiting time in a GI/G/1 queue, yielding different results, all of which fail obvious consistency checks with bounds and exact values.

TL;DR: Degeneracy checking in linear programming is NP-complete, so is the problem of checking whether there exists a basic feasible solution with a specified objective value.

TL;DR: Polynomially bounded solution methods are presented to solve a class of precedence constrained scheduling problems in which each job requires a certain amount of nonrenewable resource that is being consumed during its execution.

TL;DR: The generalized savings heuristics of Golden, Levy and Dahl are studied and several new heuristic procedures for solving the travelling purchaser problem are proposed.

TL;DR: Using optimal control theory, a diffusion model of new product acceptance is studied and it is shown by phase portrait analysis that the optimal price is steadily increasing and converging to a saddle point equilibrium.

TL;DR: Given a matrix, it is NP-hard to find a 'large' column, row, or arbitraty submatrix that satisfies property @p, where @p is nontrivial, holds for permutation matrices, and is hereditary on submatrices.

TL;DR: Based upon a theorem for lower and upper bounds on the Lagrange multiplier a fully polynomial time approximation scheme is proposed and the efficiency of the algorithm is demonstrated by a computational experiment.

TL;DR: An important interface between stochastic models and actual systems comes in estimating values for model parameters using ''real world'' data, and it is shown that the mean for the model is infinite even if the estimated traffic intensity is restricted to be strictly less than one.

TL;DR: It is concluded that otitis media must still be considered a dangerous disease, necessitating early diagnosis, intensive therapy and in case of a cholesteatoma complete and early eradication.

TL;DR: Perilymph, cerebrospinal fluid and plasma from 19 patients with acoustic neuromas were examined for albumin, alpha 2-macroglobulin and IgG, suggesting that perilymph is plasma-derived and not concentrated CSF.

TL;DR: A multivariate regenerative estimator of the stationary mean response is presented and shown to be asymptotically normal and methods for computing confidence regions and simultaneous confidence intervals are presented.

TL;DR: Polynomial-time algorithms are presented for obtaining minimum-length preemptive schedules for three cases of open shops with single-operation machines of equal speed, which can be solved by linear programming.

TL;DR: An O(n^3P) algorithm is described which solves the maximum coverage problem on trees and the same idea is applied to solve the P-median problem on Trees.

TL;DR: A double-blind crossover trial of ISO on Meniere’s disease was attempted, in cooperation with 14 other institutes, to determine the efficacy of ISO with regard to Meniere's disease.

TL;DR: Four human facial muscles, platysma, m.

TL;DR: The nature of the auditory brainstem potentials is studied, referring to the theory of the on-effect, and the consequences for the audiometric use of short tonal stimuli are discussed.