C. A. Floudas, P. M. Pardalos, Y. Lin, M. A. Stadtherr
In recent years, it has been shown that strategies based on an interval-Newton approach can be used to reliably solve a variety of nonlinear equation solving and optimization problems in chemical...
Matching techniques ride to rescue OLED displays (2009)
Karrenbauer, Andreas, Hu, X., Pardalos, P.M.
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addressing time and...
Chapter 1 STRATEGIES AND CHALLENGES OF INTERNET GROCERY RETAILING LOGISTICS ∗ (2008)
Tom Hays, Pınar Keskinocak, J. Geunes, E. Akçalı, P. M. Pardalos, ...
One of the most challenging sectors of the retail market today is the grocery segment, specifically e-grocers. Since the mid-1990’s multiple companies have entered the e-grocer market. Few have...
C. A. Floudas, P. M. Pardalos, Aqil Azmi, Richard H. Byrd, Elizabeth Eskow, Robert B. Schnabel, ...
We present a global optimization algorithm and demonstrate its effectiveness in solving the protein structure prediction problem for a 70 amino-acid helical protein, the A-chain of uteroglobin. This...
Recent advances and trends in global optimization – p.3/58 (2008)
Panos M. Pardalos, Recent Advances, C. A. Floudas, C. A. Floudas, ...
optimization
Simulating Protein Conformations through Global Optimization (2008)
Mucherino, A., Seref, O., Pardalos, P. M.
Many researches have been working on the protein folding problem from more than half century. Protein folding is indeed one of the major unsolved problems in science. In this work, we discuss a model...
c○2003 Kluwer Academic Publishers A Geometric Terrain Methodology for Global Optimization (2008)
C. A. Floudas, P. M. Pardalos, A. Lucia, P. A. Dimaggio, P. Depa
Global optimization remains an important area of active research. Many macroscopic and microscopic applications in science and engineering still present formidable challenges to current global...
A NOVEL INTEGER PROGRAMMING FORMULATION FOR THE K-SONET RING ASSIGNMENT PROBLEM (2008)
E. M. Macambira, C. N. Meneses, P. M. Pardalos
ABSTRACT. We consider the problem of interconnecting a set of customer sites using SONET rings of equal capacity, which can be defined as follows: Given an undirected graph G = (V,E) with nonnegative...
OPTIMIZATION PROBLEMS IN MULTICAST TREE CONSTRUCTION (2008)
ABSTRACT. Multicasting is a technique for data routing in networks that allows multiple destinations to be addressed simultaneously. The implementation of multicasting requires, however, the solution...
MODELING AND SOLVING STRING SELECTION PROBLEMS (2008)
C. N. Meneses, P. M. Pardalos, A. Vazacopoulos
ABSTRACT. We consider four important combinatorial problems that arise in computational biology and show how they can be modeled as integer programming problems. These models are then solved using...
C. A. Floudas, P. M. Pardalos, V. Kreinovich
When we have only interval ranges [x i, xi] of sample values x1,..., xn, what is the interval [V, V] of possible values for the variance V of these values? We show that the problem of computing the...
A NOVEL INTEGER PROGRAMMING FORMULATION FOR THE K-SONET RING ASSIGNMENT PROBLEM (2008)
E. M. Macambira, C. N. Meneses, P. M. Pardalos
ABSTRACT. We consider the problem of interconnecting a set of customer sites using SONET rings of equal capacity, which can be defined as follows: Given an undirected graph G = (V,E) with nonnegative...
Tight QAP bounds via linear programming (2008)
P. M. Pardalos, A. Migdalas, R. Burkard
Lower bounds for the quadratic assignment problem (QAP) tend to deterio-rate rapidly with the size of the QAP. Recently, Resende, Ramakrishnan, and Drezner (1995) computed a linear programming based...
RECOGNITION OF PROJECTED 3D POINTS AND LINES USING A CONTINUOUS GRASP (2008)
ABSTRACT. The field of computer vision has experienced rapid growth over the past fifty years. Many computer vision problems have been solved using theory and ideas from algebraic projective...
A CONTINUOUS GRASP TO DETERMINE THE RELATIONSHIP BETWEEN DRUGS AND ADVERSE REACTIONS (2008)
M. J. Hirsch, C. N. Meneses, P. M. Pardalos, M. A. Ragle
ABSTRACT. Adverse drug reactions (ADRs) are estimated to be one of the leading causes of death. Many national and international agencies have set up databases of ADR reports for the express purpose...
Cooperative networks : control and optimization (2008)
"Cooperative networks have gained a tremendous amount of attention over the last several years because of their existence not only in biological, social and economic arenas, but because of direct...
Cooperative networks : control and optimization (2008)
"Cooperative networks have gained a tremendous amount of attention over the last several years because of their existence not only in biological, social and economic arenas, but because of direct...
Optimization with Dynamic Models (2007)
W. W. Hager, P. M. Pardalos, Carl A. Schweiger, Christodoulos A. Floudas
Process design is usually approached by considering the steady-state performance of the process based on an economic objective. Only after the process design is determined are the operability aspects...
Bound Functions for Polynomials (2007)
C. A. Floudas, P. M. Pardalos, J. Garlo, A. P. Smith
This paper addresses the problem of nding tight ane lower bound functions for multivariate polynomials. Such underestimating functions are needed if global optimization problems involving polynomials...
C. A. Floudas, P. M. Pardalos, Julie C. Mitchell, Andrew T. Phillips, J. Ben Rosen
Burroughs Wellcome Fund for helping to support our research.
C. A. Floudas, P. M. Pardalos, Andrew T. Phillips, J. Ben Rosen, Ken A. Dill
Key problems in computational biology, including protein and RNA folding and drug docking, involve conformational searching over multidimensional potential surfaces with very large numbers of local...
Heuristics for Large Max Clique Problems Based on Continuous Approaches (2007)
In graph theory many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global...
C. A. Floudas, P. M. Pardalos, Aqil Azmi, Richard H. Byrd, Elizabeth Eskow, Robert B. Schnabel, ...
We present a global optimization algorithm and demonstrate its e#ectiveness in solving the protein structure prediction problem for a 70 amino-acid helical protein, the A-chain of uteroglobin. This...
Bound Functions for Polynomials (2007)
C. A. Floudas, P. M. Pardalos, J. Garlo, A. P. Smith
This paper addresses the problem of nding tight ane lower bound functions for multivariate polynomials. Such underestimating functions are needed if global optimization problems involving polynomials...
P. M. Pardalos, A. Migdalas, R. Burkard, Dimitris A. Fotakis, Paul G. Spirakis
Graph radio coloring and graph radio labelling are combinatorial models for two interesting cases of Frequency Assignment. In both problems positive integer labels (channels) must be assigned to all...
GRASP with path-relinking for the cooperative communication problem on ad-hoc networks (2006)
C. W. Commander, P. Festa, P. M. Pardalos, M. Tsitselis
Abstract. Ad-hoc networks are a new paradigm for communications systems in which wireless nodes can freely connect to each other without the need of a pre-specified structure. Difficult combinatorial...
Speeding up Continuous GRASP (2006)
ABSTRACT. Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hirsch et...
GRASP with path-relinking for the cooperative communication problem on ad-hoc networks (2006)
C. W. Commander, P. Festa, P. M. Pardalos
ABSTRACT. Ad-hoc networks are a new paradigm for communications systems in which wireless nodes can freely connect to each other without the need of a pre-specified structure. Difficult combinatorial...
Second order cone programming approaches to static shakedown analysis in steel plasticity (2005)
Bisbos, C.D., Makrodimopoulos, A., Pardalos, P.M.
The finite element method discretized static shakedown analysis of steel constructions leads to large, sparse convex optimization problems. Under the von Mises yield criterion, they lead to...
Matching Stochastic Algorithms to Objective Function Landscapes (2005)
Baritompa, W. P., Dur, M., Hendrix, E.M.T., Noakes, L., Pullan, Wayne John, Wood, G.R., ...
Yes
A Classification Method based on Generalized Eigenvalue Problems (2005)
M. R. Guarracino, C. Cifarelli, O. Seref, P. M. Pardalos
Binary classification refers to supervised techniques that split a set of points in two classes, with respect to a training set of points whose membership is known for each class. Binary...
A GRASP heuristic for the cooperative communication problem in ad hoc networks (2005)
ABSTRACT. Ad hoc networks are composed of a set of wireless units that can communicate directly, without the use of a pre-established server infrastructure. In an ad hoc network, each client has the...
Social Networks in Sports (2004)
V. Boginski, S. Butenko, P. M. Pardalos, O. Prokopyev
Introduction We live in the world of information, where huge amounts of data of diverse nature and origin arise in various spheres of life, including sports. To get useful information from this data,...
Frontiers In Global Optimization, pp. 1-2 (2003)
Floudas And Pardalos, C. A. Floudas, P. M. Pardalos, V. Kreinovich
When we have only interval ranges [x i ; x i ] of sample values x 1 ; : : : ; xn , what is the interval [V ; V ] of possible values for the variance V of these values? We show that the problem of...
C. A. Floudas, P. M. Pardalos, V. Kreinovich
When we have only interval ranges [x i ; x i ] of sample values x 1 ; : : : ; xn , what is the interval [V ; V ] of possible values for the variance V of these values? We show that the problem of...
A New Heuristic For The Minimum Connected Dominating Set Problem On Ad Hoc Wireless Networks (2003)
Sergiy Butenko, Xiuzhen Cheng, P. M. Pardalos
Given a graph G = (V, E), a dominating set D is a subset of V such that any vertex not in D is adjacent to at least one vertex in D. Efficient algorithms for computing the minimum connected...
A genetic algorithm for the weight setting problem in ospf routing (2002)
Abstract. With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of...
A genetic algorithm for the weight setting problem in ospf routing (2002)
Abstract. With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of...
Randomized heuristics for the max-cut problem (2002)
P. Festa, P. M. Pardalos, C. C. Ribeiro
Abstract. Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having...
Combinatorial and global optimization (2002)
Pardalos, P. M., Migdalas, Athanasios., Burkard, Rainer E.
"Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and...
Combinatorial and global optimization (2002)
Pardalos, P. M., Migdalas, Athanasios., Burkard, Rainer E.
"Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and...
Finding independent sets in a graph using continuous multivariable polynomial formulations (2001)
J. Abello, S. Butenko, P. M. Pardalos
Abstract. Two continuous formulations of the maximum independent set problem on a graph G = (V, E) are considered. Both cases involve the maximization of an n-variable polynomial over the...
Randomized communication in radio networks (2001)
Bogdan S. Chlebus, Instytut Informatyki, Uniwersytet Warszawski, P. M. Pardalos, S. Rajasekaran, J. Reif, ...
Abstract A communication network is called a radio network if its nodes exchange messages in the following restricted way. First, a send operation performed by a node delivers copies of the same...
On the Chromatic Number of Graphs (2001)
S. Butenko, P. Festa, P. M. Pardalos
Computing the chromatic number of a graph is an NP-hard problem. For random graphs and some other classes of graphs, estimators of the expected chromatic number have been well studied. In this paper,...
GRASP and VNS for Max-Cut (2001)
Paola Festa Pardalos, P. M. Pardalos, Celso C. Ribeiro
Introduction and problem formulation The Max-Cut problem can be stated as follows: Given an undirected graph G =(V,E) and nonnegative weights w ij on the edges (i, j) E, i, j V , find a subset of...
A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy (2000)
S. L. Martins, C. C. Ribeiro, P. M. Pardalos
Abstract. In this paper, we present a parallel greedy randomized adaptive search procedure (GRASP) for the Steiner problem in graphs. GRASP is a two phase metaheuristic. In the first phase, solutions...
GRASP with path-relinking for the three-index assignment problem (2000)
R. M. Aiex, P. M. Pardalos, G. Toraldo
Abstract. This paper describes variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three index assignment problem (AP3). GRASP is a multi-start metaheuristic...
A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy (2000)
S. L. Martins, C. C. Ribeiro, P. M. Pardalos
ABSTRACT. In this paper, we present a parallel greedy randomized adaptive search procedure (GRASP) for the Steiner problem in graphs. GRASP is a two phase metaheuristic. In the first phase, solutions...
On maximum clique problems in very large graphs (1999)
Abstract. We present an approach for clique and quasi-clique computations in very large multi-digraphs. We discuss graph decomposition schemes used to break up the problem into several pieces of...
A Parallel GRASP For The Steiner Tree Problem In Graphs Using A Hybrid Local Search Strategy (1999)
S. L. Martins, C. C. Ribeiro, P.M. Pardalos
In this paper, we present a parallel greedy randomized adaptive search procedure (GRASP) for the Steiner problem in graphs. GRASP is a two phase metaheuristic. In the first phase, solutions are...
A. Bertossi, Proceedings Of Algorithms, P. M. Pardalos
. Resende. On maximum clique problems in very large graphs. In J. Abello and J. Vitter, editors, External memory algorithms and visualization, DIMACS Series on Discrete Mathematics and Theoretical...
Global Optimization Approaches in Protein Folding and Peptide Docking (1999)
C. A. Floudas, J.L. Klepeis, P.M. Pardalos
. The recent advances in genetic engineering, high powered computing and global optimization continue to stimulate interest in the area of molecular modeling and protein structure prediction. The...
Recent Advances in Global Optimization. (1998)
Floudas, C. A., Pardalos, P. M.
The conference on :Recent Advances In Global Optimization took place during May 10-11, 1991 at Princeton University. It was organized by Professor C.A. Floudas (Princeton University) and P.M....
On Very Large Maximum Clique Problems (Extended Abstract) (1998)
) J. Abello Network Services Research, AT&T Labs Research, 180 Park Avenue Florham Park, NJ 07932-0971, USA e-mail: abello@research.att.com P. M. Pardalos Center for Applied Optimization,...
P. Sussner, P. M. Pardalos, G. X. Ritter
In morphological image processing and analysis, a template or structuring element is applied to an image. Often savings in computation time and a better fit to the given computer architecture can be...
On a SQP-Multigrid Technique for Nonlinear Parabolic Boundary Control Problems (1997)
W. W. Hager, P. M. Pardalos, Helmuth Goldberg, Fredi Tröltzsch, H. Goldberg, F. Troltzsch
We consider the application of an SQP method to an optimal control problem governed by the heat equation with nonlinear boundary conditions. The objective functional consists of a quadratic terminal...
Absolute stability of feedback systems in Hilbert spaces (1997)
W. W. Hager, P. M. Pardalos, Francesca Bucci, Via S. Marta
The problem of absolute stability of a feedback loop of an abstract differential system in Hilbert spaces is considered. Applications of Popov's type frequency domain criteria and of the...
P.M. Pardalos, K. G. Ramakrishnan, Y. Li
. The efficient implementation of a branch and bound algorithm for the quadratic assignment problem (QAP), incorporating the lower bound, based on variance reduction, of Li, Pardalos, Ramakrishnan,...
Multidifferential Calculus: Chain Rule, Open Mapping and Transversal Intersection Theorems (1997)
W. W. Hager, P. M. Pardalos, Hector J. Sussmann
this paper (Theorem 4.3.3). For this reason, we now believe that the more restrictive definition proposed here ought to supersede that of [15]. Since we still feel that the word used in [15] is the...
A GRASP for the Biquadratic Assignment Problem (1996)
T. Mavridou, P.M. Pardalos, L. Pitsoulis
The biquadratic assignment problem (BiQAP) is a generalization of the quadratic assignment problem (QAP). It is a nonlinear integer programming problem where the objective function is a fourth degree...
A Parallel GRASP for MAX-SAT Problems (1996)
The weighted maximum satisfiability (MAX-SAT) problem is central in mathematical logic, computing theory, and many industrial applications. In this paper, we present a parallel greedy randomized...
Approximate Solution Of Weighted Max-Sat Problems Using Grasp (1996)
Computing the optimal solution to an instance of the weighted maximum satisfiability problem (MAX-SAT) is difficult even when each clause contains at most two literals. In this paper, we describe a...
Parallel Algorithms for Global Optimization Problems (1995)
P.M. Pardalos, G. Xue, P.D. Panagiotopoulos
In this chapter we discuss parallel algorithms for solving some classes of global optimization problems. We present an introductory survey of parallel algorithms that have been used to solve...
K. G. Ramakrishnan, P.M. Pardalos
In this paper, we study a branch and bound algorithm for the quadratic assignment problem (QAP) that uses a lower bound based on the linear programming (LP) relaxation of a classical integer...
A Parallel GRASP Implementation for the Quadratic Assignment Problem (1995)
P.M. Pardalos, L. S. Pitsoulis
In this paper we present a parallel implementation of a Greedy Randomized Adaptive Search Procedure (grasp) for finding approximate solutions to the quadratic assignment problem. In particular, we...
T. Mavridou, P.M. Pardalos, L. Pitsoulis
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementation of genetic...
Lower Bounds For The Quadratic Assignment Problem (1994)
Y. Li, P.M. Pardalos, K.G. Ramakrishnan
. We investigate the classical Gilmore-Lawler lower bound for the quadratic assignment problem. We provide evidence of the difficulty of improving the Gilmore-Lawler Bound and develop new bounds by...
A Simple, Quadratically Convergent Interior Point Algorithm for Linear Programming and. . . (1993)
André L. Tits, W. W. Hager, D. W. Hearn, P. M. Pardalos, Jian L. Zhou
An algorithm for linear programming (LP) and convex quadratic programming (CQP) is proposed, based on an interior point iteration introduced more than ten years ago by J. Herskovits for the solution...
Some Bounds on the Complexity of Gradients, Jacobians, and Hessians (1993)
P. M. Pardalos, Andreas Griewank
The evaluation or approximation of derivatives is an important part of many nonlinear computations. The cost of evaluating first- and second-derivative matrices is often assumed to grow linearly and...
)1993 Kluwer Academic Publishers B.V. On Very Large Scale Assignment Problems (1993)
W. W. Hager, D. W. Hearn, P. M. Pardalos, Yusin Lee, James B. Orlin
In this paper we present computational testing results on very large scale random assignment problems. We consider a fully dense assignment problem with 2n nodes. Some conjectured or derived...
A GRASP for the biquadratic assignment problem
Mavridou, T., Pardalos, P.M., Pitsoulis, L.S., Resende, Mauricio G.C.
Randomized Communication in Radio Networks
Bogdan S. Chlebus, Instytut Informatyki, Uniwersytet Warszawski, P. M. Pardalos, S. Rajasekaran, J. Reif, ...
A communication network is called a radio network if its nodes may exchange messages among themselves in a certain restricted way. First, a multicast performed by a node delivers copies of the same...