Showing papers in "Operations Research Letters in 1990"

TL;DR: In this paper, a partially enumerative algorithm for the maximum clique problem is presented, which is very simple to implement on an IBM 3090 computer and can be used to generate graphs with up to 3000 vertices and over one million edges.

TL;DR: In this paper, conditions under which DEA models are translation invariant are established under which affine displacement does not alter the efficient frontier for models incorporating the convexity constraint, which affords a ready solution to the problems of scaling and the presence of zero values which arise in Data Envelopment Analysis.

TL;DR: In this paper, the authors report the solution to optimality of a 532-city symmetric traveling salesman problem involving the optimization over 141,246 zero-one variables, and briefly outline the methodology, algorithms and software system that they developed to obtain these results.

TL;DR: In this article, an exact algorithm was proposed to determine the k most vital arcs in a network and an algorithm of time complexity equal to that of Dijkstra's algorithm for the shortest path problem was developed to solve the single most vital arc problem.

TL;DR: It is concluded that drivers with the clinical features of SAS are at increased risk especially for single-car accidents and that the risk seems to vary with the severity of symptoms.

TL;DR: The shooters had significantly better stability than untrained control subjects, when tested without supportive clothing, and the Romberg quotient was higher in shooters than in normal controls, indicating that they used to an increased amount proprioceptive and vestibular cues to stabilize their posture.

TL;DR: This work considers the H-horizon, stationary Markov decision problem, and gives an @e-approximation algorithm whose time is proportional to log(1/@e), log(H) and1(1 - @a) for problems where @a is bounded away from 1.

TL;DR: Several single-commodity, two-and multichannel flow formulations have been introduced for the traveling salesman problem as discussed by the authors, and some results are probably known by researchers in the area.

TL;DR: It will be proved that the only solution satisfying consistency axioms for the problem of retrieving weights from inconsistent additive judgements matrices is the arithmetic mean.

TL;DR: A model of competition between two profit-maximizing firms which produce and sell a single homogeneous product to customers located on a network and a Hakimi-type property stating that firms may limit themselves to the vertices of the network to find the equilibrium locations is presented.

TL;DR: In an immunohistochemical study, monoclonal and polyclonal antibodies have been used to identify cells and structures in the extraosseous part of endolymphatic sacs (ES) which were removed at autopsy from 30 persons as discussed by the authors.

TL;DR: For finite games, the conditions include the well-known cases of strict dominance, and in a slightly weaker form, of regular dominance for zero-sum and similar games.

TL;DR: Some problems in distributed system control, such as load balancing, routing, scheduling in a real-time environment, and reconfiguration require two-phase execution at a central server.

TL;DR: Upper bounds, dominance relations, and an approach-based on the definition of a core problem-to the exact solution of very large instances of the unbounded knapsack problem are presented.

TL;DR: In this article, the authors show that the norm of the residual can be an arbitrarily poor predictor of a good search direction for nonlinear nonlinear optimization problems, and that the search direction is usually assessed using the norm.

TL;DR: In this article, the authors describe a simulation experiment involving nine exponential queues in series with a non-Poisson arrival process, which demonstrates that the heavy-traffic bottleneck phenomenon can occur in practice (at reasonable traffic intensities) as well as in theory.

TL;DR: In this article, three different approaches are generalised to obtain upper bounds for the maximum of a quadratic pseudo-Boolean function f over [0, 1]^n.

TL;DR: For the case of Poisson demand and exponential lifetime distribution, an alternative approach is used which gives the stationary probability distribution of the inventory level and other system performance measures explicity from these measures, a closed form long-run expected cost function is established and its analytical properties are discussed as mentioned in this paper.

TL;DR: In this paper, the authors established the constants @b"M"S"T(d), @b'M(d) for the minimum spanning tree (MST), the minimum matching (M), the travelling salesman problem (TSP), etc.

TL;DR: In this paper, the mean flow time problem and the mean absolute deviation problem for multiple uniform parallel machines are shown to be equivalent, and a reduction of the MAD problem into a transportation problem is presented.

TL;DR: The notion of coefficient reduction is extended for 0-1 knapsack-like constraints by taking advantage of the special structure of variable bounding constraints.

TL;DR: In this article, the authors give a sufficient condition for an inequality defining a facet of P"c(G) to define a subgraph of a graph containing G as an induced subgraph.

TL;DR: BR seems to be a useful index for predicting the prognosis in an early stage of the paralysis, however, more than one test should be performed at the same time to accurately establish the prog outlook.

TL;DR: In this paper, the stochastically proportional yield problem is investigated using the "stochastically proportional" yield concept, which does not assume independence of units in a lot and is shown to have explicit and highly interpretable solutions in some cases.

TL;DR: The first phase of caloric nystagmus in rhesus monkeys in the 'optimum' supine or prone position was recorded three-dimensionalally using magnetic search coils as discussed by the authors.

TL;DR: This study provides the first full description of in vitro ciliogenesis on a human tissue and reconstructs the different cytoplasmic stages comparable to that described in the embryogenesis of the mammalian respiratory tract.

TL;DR: 'Vertigo', an ES aimed at the classification and diagnosis of different forms of dizziness, is presented and is presently being used by ENT residents during their otoneurology stage.

TL;DR: There is a significant decrease in the nasal mucociliary clearance of patients with nasal polyposis, according to the saccharin test, compared with a control group of 20 healthy subjects.

TL;DR: It is shown how the resulting problem can be solved by an efficient algorithm which solves a series of quadratic knapsack problems in O(n) time.

TL;DR: If processing times on the machines are comparable in the sense of likelihood ratio, then it is optimal to use slower machines in the first and last position than in the second and penultimate positions.