Found 97029 papers in total
On graphs preserving rectilinear shortest paths in the presence of obstacles
1991,
In physical VLSI design, network design (wiring) is the most time-consuming phase. For solving global...
Steiner minimal trees for three points with one convex polygonal obstacle
1991,
The problem of constructing Steiner minimal trees in the Euclidean plane in NP-hard. When in addition...
Travelling salesman problem tools for microcomputers
1991,
The problem of determining minimum total distance to be travelled by a salesman, who is to visit given...
Efficient implementation of heuristics for the continuous network design problem
1991,
In this paper, the authors present an efficient implementation of heuristic procedures for solving the...
Asymptotic behavior of random discrete event systems
1990,
In this paper the authors discuss some aspects of the asymptotic behavior of Discrete Event Dynamic...
Optimal prices of a job shop with a single work station: A discrete time model
1991,
The topic is the optimal control of input to a discrete-time FIFO job shop with a single work station. The...
NP-completeness and approximation algorithm for the maximum integral vertex-balanced flow problem
1991,
Minoux considered the maximum balanced flow problem of a two-terminal network, which is the problem of...
Least-cost network topology design for a new service: An application of tabu search
1991,
The authors describe an implementation of the tabu search metaheuristic that effectively finds a low-cost...
Polynomially solvable special cases of the Steiner problem in planar networks
1991,
The authors give polynomial-time algorithms for two special cases of the Steiner problem: (1)the...
Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
1992,
Nonlinear bilevel programming problems, of which the equilibrium network design problem is one, are...
A polynomial time interior point algorithm for minimum cost flow problems
1990,
This paper deals with a minimum cost flow problem. The authors propose a polynomial time algorithm for the...
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
1991,
The authors give a short proof that the network simplex algorithm with either the smaller label or the...
A multiobjective stochastic shortest-route problem
1988,
This paper develops an algorithm for a ‘shortest route’ network problem in which it is...
Computing shortest paths in networks derived from recurrence relations
1991,
Dynamic programming formulations of optimization problems often call for the computation of shortest paths...
The scheduling of activities to maximize the net present value of projects
1990,
The authors review and critique the approaches offered for the resolution of the problem of maximizing the...
Introduction to computation and learning in artificial neural networks
1990,
A short historical overview of the development of artificial neural networks is given and some of the...
Fast multiple-precision calculation of square root
1990,
In this paper a family of higher-order converging algorithms is derived for the multiple-precision...
Ancestor tree for arbitrary multi-terminal-cut functions
1991,
In many applications, a function is defined on the cuts of a network. In the max-flow min-cut theorem, the...
Numerical solutions of nonlinear integral equations by approximations of fixed-points
1990,
This paper considers a numerical method for approximating solutions of Hammerstein’s equation on the...
Real fast fourier transform on quasi-equidistant sample points
1990,
Trigonometric polynomial interpolation of periodic functions with period 2; on equidistant points in the...
A parallel quasi-Newton method for optimization problems with equality constraints
1989,
A great deal of attention has been paid to Newton-like methods to solve constrained optimization problems....
Rational arithmetic for Gomory’s fractional method
1990,
This paper intends to investigate the inherent behavior of Gomory’s fractional method for pure...
An optimization algorithm for sequentially constructed problems and its stability
1991,
This paper is concerned with a new type of optimization problems, which are called ‘sequently...
A method of seeking feasible solutions based on distributed problem solving
1991,
A problem of seeking feasible solutions under a large number of constraints is decomposed into a set of...
Papers per page:

Paper Filter