Keyword: computational analysis

Found 489 papers in total
Remarks on: ‘Some extensions of the discrete lotsizing and scheduling problem’
Remarks on: ‘Some extensions of the discrete lotsizing and scheduling problem’
1997,
Salomon et al. claim the NP-completeness of different variants of the discrete...
Lower bounds for off-line range searching
Lower bounds for off-line range searching
1997,
This paper proves three lower bounds for variants of the following range-searching...
Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
1997,
This paper presents an algorithm and its probabilistic analysis for constructing the...
The numerical calculation of the Moore–Penrose pseudoinverse of a matrix
The numerical calculation of the Moore–Penrose pseudoinverse of a matrix
1996,
The problem of the numerical calculation of the Moore–Penrose pseudoinverse is...
Numerical calculation of the pseudoinverse using Leonov's minimal method
Numerical calculation of the pseudoinverse using Leonov's minimal method
1996,
Basic concepts and statements of the method of minimal pseudoinverse matrix developed...
A class of polynomial variable metric algorithms for linear optimization
A class of polynomial variable metric algorithms for linear optimization
1996,
In the paper, the behaviour of interior point algorithms is analyzed by using a...
Stationary probabilities of Markov chains with upper Hessenberg transition matrices
Stationary probabilities of Markov chains with upper Hessenberg transition matrices
1997,
In this paper, based on probabilistic arguments, we obtain an explicit solution of the...
Curbing the computational difficulty of the logit equilibrium assignment model
Curbing the computational difficulty of the logit equilibrium assignment model
1997,
In the past, research in traffic assignment modeling has been directed primarily...
A probit-based stochastic user equilibrium assignment model
A probit-based stochastic user equilibrium assignment model
1997,
Stochastic methods of traffic assignment have received much less attention in the...
Single machine scheduling with batch set-up times to minimize maximum lateness
Single machine scheduling with batch set-up times to minimize maximum lateness
1997,
This paper considers a problem of scheduling N jobs on a single machine to minimize...
Complexity of a restricted chinese postman problem
Complexity of a restricted chinese postman problem
1996,
The Chinese Postman Problem (CPP) on mixed graphs is shown to be NP-complete. It...
Shortest path problem with an obstructor
Shortest path problem with an obstructor
1996,
Let G=(V,A) be a directed graph with (positive) length l(a) for each a∈A, and two...
A new computational method for the functional inequality constrained minimax optimization problem
A new computational method for the functional inequality constrained minimax optimization problem
1997,
In this paper, the authors consider a general class of functional inequality...
Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
1994,
The ultimate purpose of the present analysis is to show that for any class of linear...
Computational experience with an approximation algorithm on large-scale Euclidean matching instances
Computational experience with an approximation algorithm on large-scale Euclidean matching instances
1996,
The authors consider a 2-approximation algorithm for Euclidean minimum-cost perfect...
An improved algorithm for the constrained bottleneck spanning tree problem
An improved algorithm for the constrained bottleneck spanning tree problem
1996,
The authors propose an algorithm to solve the bottleneck spanning tree problem with an...
Some experimental and theoretical results on test case generators for the maximum clique problem
Some experimental and theoretical results on test case generators for the maximum clique problem
1996,
The authors describe and analyze test case generators for the maximum clique problem...
On the Laguerre method for numerically inverting Laplace transforms
On the Laguerre method for numerically inverting Laplace transforms
1996,
The Laguerre method for numerically inverting Laplace transforms is an old established...
Shortest paths algorithms: Theory and experimental evaluation
Shortest paths algorithms: Theory and experimental evaluation
1996,
The authors conduct an extensive computational study of shortest paths algorithms,...
A comparison of alternative approaches for numerical solutions of GI/PH/1 queues
A comparison of alternative approaches for numerical solutions of GI/PH/1 queues
1996,
This paper compares alternative approaches for computing the R matrix of Neuts in...
On line scheduling with optimal worst-case response time
On line scheduling with optimal worst-case response time
1995,
An on-line algorithm for scheduling independent processes in a distributed computer...
The minimum spanning tree problem on a planar graph
The minimum spanning tree problem on a planar graph
1995,
Finding a spanning tree of minimum weight is one of the best known graph problems....
A modified termination rule for Karmarkar’s algorithm
A modified termination rule for Karmarkar’s algorithm
1995,
In this note the authors have proposed a modified termination rule for...
On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
1995,
Recently, Mehrotra proposed a predictor-corrector primal-dual interior-point algorithm...
Papers per page: