Keyword: computational analysis

Found 489 papers in total
Parallel Computing in Optimization
Parallel Computing in Optimization
1998,
Information geometric analysis of semidefinite programming problems
Information geometric analysis of semidefinite programming problems
1998,
In this paper, we consider semidefinite programming (SDP) problems from points of view...
Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem
Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem
1999,
This note proposes a transformation of the Generalized Traveling Salesman Problem on...
Identification of Pareto-efficient facets in Data Envelopment Analysis
Identification of Pareto-efficient facets in Data Envelopment Analysis
1998,
In Data Envelopment Analysis (DEA), identification of the Pareto-efficient frontier of...
On the complexity of two-machine flowshop problems with due date related objectives
On the complexity of two-machine flowshop problems with due date related objectives
1998,
The complexity of two-machine flowshop problems with due date related criteria is...
A polynomial algorithm for a two-machine no-wait job-shop scheduling problem
A polynomial algorithm for a two-machine no-wait job-shop scheduling problem
1998,
This paper considers the no-wait scheduling of n jobs, where each job is a chain of...
Note on ‘parallel machine scheduling with batch setup times’
Note on ‘parallel machine scheduling with batch setup times’
1998,
Cheng and Chen use a high-multiplicity encoding scheme to prove binary NP -hardness of...
The minimum covering lpb-hypersphere problem
The minimum covering lpb-hypersphere problem
1998,
The minimum covering hypersphere problem is defined as to find a hypersphere of...
A constant-potential infeasible-start interior-point algorithm with computational experiments and applications
A constant-potential infeasible-start interior-point algorithm with computational experiments and applications
1998,
We present a constant-potential infeasible-start interior-point (INFCP) algorithm for...
Using forward accumulation for automatic differentiation of implicitly-defined functions
Using forward accumulation for automatic differentiation of implicitly-defined functions
1998,
This paper deals with the calculation of partial derivatives (w.r.t. the independent...
A hybrid smoothing method for mixed nonlinear complementarity problems
A hybrid smoothing method for mixed nonlinear complementarity problems
1998,
In this paper, we describe a new, integral-based smoothing method for solving the...
An interior-point method for approximate positive semidefinite completions
An interior-point method for approximate positive semidefinite completions
1998,
Given a nonnegative, symmetric matrix of weights, H , we study the problem of finding...
The computational complexity of the k-minimum spanning tree problem in graded matrices
The computational complexity of the k-minimum spanning tree problem in graded matrices
1998,
Given an undirected graph G = ( V, E ) where each edge e = ( i, j ) has...
Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing
Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing
1998,
Numerous techniques for generating approximate solutions have been proposed in the...
Computational Learning and Probabilistic Reasoning
Computational Learning and Probabilistic Reasoning
1997,
On the feedback vertex set problem in permutation graphs
On the feedback vertex set problem in permutation graphs
1994,
Brandstat and Kratsch presented an O( n 6 ) time algorithm for the minimum weight...
Interval graph problems on reconfigurable meshes
Interval graph problems on reconfigurable meshes
1995,
A graph G is an interval graph if there is a one–one correspondence between its...
A polyhedral approach to the asymmetric traveling salesman problem
A polyhedral approach to the asymmetric traveling salesman problem
1997,
Several branch-and-bound algorithms for the exact solution of the asymmetric traveling...
Optimal design of continuum structure by genetic algorithm – Simultaneous determination of shape and material
Optimal design of continuum structure by genetic algorithm – Simultaneous determination of shape and material
1998,
In this paper, the genetic algorithms (GAs) are applied to the optimal design of the...
A matching identification problem: A knowledge acquisition approach
A matching identification problem: A knowledge acquisition approach
1995,
The paper is concerned with an identification problem of a set of K out of N numbers....
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,
We consider a 2-approximation algorithm for Euclidean minimum-cost perfect matching...
Ismorphic routing on a toroidal mesh
Ismorphic routing on a toroidal mesh
1996,
We study a routing problem that arises on SIMD parallel architectures whose...
Optimal trellis-based buffered compression and fast approximations
Optimal trellis-based buffered compression and fast approximations
1994,
We formalize the description of the buffer-constrained adaptive quantization problem....
A dual projective simplex method for linear programming
A dual projective simplex method for linear programming
1998,
The method proposed in this paper is a dual version of the projective simplex method,...
Papers per page: