Found 97029 papers in total
A generalized k-opt exchange procedure for the MTSP
1989,
This paper presents a technique that generalizes the classical k- opt exchange procedure for the symmetric...
Tabu Search techniques-A tutorial and an application to neural networks
1989,
Tabu Search is a general heuristic procedure for global optimization. Based on simple ideas it has been...
A method of rapid RSA key generation
1989,
This paper improves a method for key generation of RSA public key cryptosystems. In order to construct an...
Markov and Markov reward model transient analysis: An overview of numerical approaches
1989,
The advent of fault-tolerant, distributed systems has led to increased interest in analytic techniques for...
Mean first-passage times for a k-out-of-n system with repair
1989,
Consider a k- out-of- n system where the lifetimes of the components are independent and identically...
Semi-Markov decision processes with a reachable state-subset
1989,
The paper considers the problem of minimizing the long-run average expected cost per unit time in a...
An example of a nonregular semimontone Q-matrix
1989,
In their paper, Aganagic and Cottle gave necessary and sufficient conditions for a P 0 - matrix to be a Q-...
Finding the most vital arcs in a network
1989,
Let be a directed, arc weighted network with node set V and arc set A . Associated with each arc is a...
A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks
1989,
Shuffle-exchange networks have received a great deal of attention as interconnecting networks for parallel...
Bounding the expected time-cost curve for a stochastic PERT network flow
1989,
Based on some earlier work by Wollmer on how to approximate the expected time-cost curve for a random PERT...
An interactive system for constructing timetables on a PC
1989,
A new network flow model is presented for constructing timetables for an adult training school. This...
Submodularity and valid inequalities in capacitated fixed charge networks
1989,
Using a submodular inequality, and the observation that the flow values in capacitated fixed charge...
Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
1989,
Determining efficient sequences of X-ray diffraction measurements on a four-circle diffractometer leads to...
Open questions concerning Weiszfeld’s algorithm for the Fermat-Weber location problem
1989,
The Fermat-Weber location problem is to find a point in ℝ n that minimizes the sum of the weighted...
The k most vital arcs in the shortest path problem
1989,
The k most vital arcs in a network are those whose removal from the network results in the greatest...
Solving generalized equations over infinite trees
1989,
In the paper a nondeterministic algorithm for solving sets of equations between terms built-up from...
A note on stochastic search methods for global optimization
1988,
Let [ A n ,B n ] be random subintervals of [0,1] defined recursively as follows. Let A 1 =0, B 1...
Infinite horizon optimization
1989,
The authors consider the general problem of choosing a discounted cost minimizing infinite sequence of...
Differential equations approach in constraint minimization
1989,
In this paper a discussion of relatively new class of methods dealing with constraint minimization...
Preference structure representation using convex cones in multicriteria integer programming
1989,
A new efficient system of representing the decision-maker’s preference structure in solving...
Average cost expansion sequencing
1989,
The paper derives necessary and sufficient conditions for the optimality of a sequencing of capacity...
A linear-time median-finding algorithm for projecting a vector on the simplex of ℝn.
1989,
An O(n) time algorithm for the projection of a vector is presented on the simplex of ℝ n . The...
Lexicographic egalitarian solution and uncertainty in the disagreement point
1989,
The paper analyzes bargaining situations in which the feasible set is known but the disagreement point is...
Lower bounds proofs via Voronoi diagrams
1989,
It is shown that the large class of geometric problems satisfying an ¦[( n log n) time bound with...
Papers per page:

Paper Filter