Pardalos P.M.

P.M. Pardalos

Information about the author P.M. Pardalos will soon be added to the site.
Found 13 papers in total
Analysis of stock market structure by identifying connected components in the market graph
Analysis of stock market structure by identifying connected components in the market graph
2005
We consider a recently introduced network-based representation of the U.S. stock...
Flow search approach and new bounds for the m-step linear conjugate gradient algorithm
Flow search approach and new bounds for the m-step linear conjugate gradient algorithm
2004
A flow search approach is presented in this paper. In the approach, each iterative...
Continuous characterizations of the maximum clique problem
Continuous characterizations of the maximum clique problem
1997
Given a graph G whose adjacency matrix is A , the Motzkin–Strauss formulation of...
A GRASP for the biquadratic assignment problem
A GRASP for the biquadratic assignment problem
1998
The biquadratic assignment problem (BiQAP) is a generalization of the quadratic...
A polynomial time dual algorithm for the Euclidean multifacility location problem
A polynomial time dual algorithm for the Euclidean multifacility location problem
1996
The Euclidean multi-facility location (EMFL) problem is one of locating new facilities...
Linear programming approaches to the convex hull problem in Rm.
Linear programming approaches to the convex hull problem in Rm.
1995
In this paper, two linear programming formulations of the convex hull problem are...
On the evaluation and application of different scales for quantifying pairwise comparisons in fuzzy sets
On the evaluation and application of different scales for quantifying pairwise comparisons in fuzzy sets
1994
One of the most critical issues in many applications of fuzzy sets is the successful...
Lower bounds for the quadratic assignment problem
Lower bounds for the quadratic assignment problem
1994
The authors investigate the classical Gilmore-Lawler lower bound for the quadratic...
Single-source uncapacitated minimum concave-cost network flow problems
Single-source uncapacitated minimum concave-cost network flow problems
1991
The authors investigate the single-source uncapacitated (SSU) version of the minimum...
Minimum concave-cost network flow problems applications, complexity, and algorithms
Minimum concave-cost network flow problems applications, complexity, and algorithms
1990
The authors discuss a wide range of results for minimum concave-cost network flow...
An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
1990
This paper gives an O( n) algorithm for a singly constrained convex quadratic program...
Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
1990
On parallel architectures, Jacobi methods for computing the singular value...
Linear complementarity problems solvable by integer programming
Linear complementarity problems solvable by integer programming
1988
In this paper it is shown how to solve a linear complementarity problem (or verify...
Papers per page: