Keyword: computational analysis

Found 489 papers in total
On average complexity of global optimization problems
On average complexity of global optimization problems
1992,
The average case complexity of global optimization problems is discussed. The average...
A strongly polynomial algorithm for a special class of linear programs
A strongly polynomial algorithm for a special class of linear programs
1991,
The authors extend the list of linear programming problems that are known to be...
On the finite convergence of interior-point algorithms for linear programming
On the finite convergence of interior-point algorithms for linear programming
1992,
It has been shown that numerous interior-point algorithms for linear programming (LP)...
On the Minimum-Cardinality-Bounded-Diameter and the Bounded-Cardinality-Minimum-Diameter Edge Addition Problems
On the Minimum-Cardinality-Bounded-Diameter and the Bounded-Cardinality-Minimum-Diameter Edge Addition Problems
1992,
Given a graph G=(V,E), positive integers D<ℝVℝ and B, the...
An exact sublinear algorithm for the max-flow, vertex disjoint paths and communication problems on random graphs
An exact sublinear algorithm for the max-flow, vertex disjoint paths and communication problems on random graphs
1992,
This paper describes a randomized algorithm for solving the maximum-flow maximum-cut...
On the computational complexity of reliability redundancy allocation in a series system
On the computational complexity of reliability redundancy allocation in a series system
1992,
Finding the optimal redundancy that maximizes the system reliability is one of the...
Numerical inversion of probability generating functions
Numerical inversion of probability generating functions
1992,
Random quantities of interest in operations research models can often be determined...
Algorithms for detecting separability of nonlinear mappings using computational graphs
Algorithms for detecting separability of nonlinear mappings using computational graphs
1991,
A nonlinear mapping is called separable if it contains some of the variables in the...
Sufficient optimality conditions and duality for a pseudoconvex minimax problem
Sufficient optimality conditions and duality for a pseudoconvex minimax problem
1991,
Sufficient optimality conditions and duality theorems are presented for a pseudoconvex...
Strongly polynomial algorithms for the high multiplicity scheduling problem
Strongly polynomial algorithms for the high multiplicity scheduling problem
1991,
A high multiplicity scheduling problem consists of many jobs which can be partitioned...
Local convergence in a generalized Fermat-Weber problem
Local convergence in a generalized Fermat-Weber problem
1993,
In the Fermat-Weber problem, the location of a source point in ℝ N is sought...
On the integral plane two-commodity flow problem
On the integral plane two-commodity flow problem
1992,
The authors consider in this note the maximum integral two-commodity flow problem in...
Bounding the distribution of project duration in PERT networks
Bounding the distribution of project duration in PERT networks
1992,
The PERT model of a project composed of m activities whose durations are independent...
Time complexity of single machine scheduling with stochastic precedence constraints
Time complexity of single machine scheduling with stochastic precedence constraints
1992,
This paper deals with single machine scheduling problems with stochastic precedence...
Computational techniques for solving global optimization problems
Computational techniques for solving global optimization problems
1991,
Global optimization has been the subject of active research in the last two decades....
Probabilistic analysis of the generalised assignment problem
Probabilistic analysis of the generalised assignment problem
1992,
The authors analyse the generalised assignment problem under the assumption that all...
Conjugate duality and the curse of dimensionality
Conjugate duality and the curse of dimensionality
1991,
If the functional equations of dynamic programming (DP) are viewed as convolutions,...
Long steps in an O(n3L) algorithm for linear programming
Long steps in an O(n3L) algorithm for linear programming
1992,
The authors consider partial updating in Ye’s affine potential reduction...
On a global error bound for a class of monotone affine variational inequality problems
On a global error bound for a class of monotone affine variational inequality problems
1992,
The authors give, for a class of monotone affine variational inequality problems, a...
A combinatorial interior point method for network flow problems
A combinatorial interior point method for network flow problems
1992,
For solving minimum cost flow problems, the authors develop a combinatorial interior...
A barrier function method for minimax problems
A barrier function method for minimax problems
1992,
This paper presents an algorithm based on barrier functions for solving semi-infinite...
Convergence rates of a global optimization algorithm
Convergence rates of a global optimization algorithm
1992,
This paper presents a best and worst case analysis of convergence rates for a...
A new polynomial time method for a linear complementarity problem
A new polynomial time method for a linear complementarity problem
1992,
The purpose of this paper is to present a new polynomial time method for a linear...
The bisection method in higher dimensions
The bisection method in higher dimensions
1992,
Is the familiar bisection method part of some larger scheme? The aim of this paper is...
Papers per page: