#### Filter Results:

- Full text PDF available (251)

#### Publication Year

1986

2017

- This year (28)
- Last 5 years (156)
- Last 10 years (298)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Data Set Used

#### Key Phrases

#### Method

#### Organism

Learn More

- Panos M. Pardalos
- Optimization Methods and Software
- 2007

Weather • Robust design of emergency response networks. • Design of financial instruments to hedge against weather emergencies to protect individuals, companies and municipalities. • Design of sensor networks and communication systems to manage responses to major weather events. Disease • Models of disease propagation for response planning. • Management of… (More)

This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It discusses the most important developments in all aspects of the QAP such as linearizations, QAP polyhedra, algorithms to solve the problem to optimality, heuristics, polynomially solvable special cases, and asymptotic behavior. Moreover, it also considers problems… (More)

- Monica Gabriela Cojocaru, Patrizia Daniele, +4 authors John F. Smith
- 2004

In this paper, we make explicit the connection between projected dynamical systems on Hilbert spaces and evolutionary variational inequalities. We give a novel formulation that unifies the underlying constraint sets for such inequalities, which arise in time-dependent traffic network, spatial price, and a variety of financial equilibrium problems. We… (More)

- Panos M. Pardalos, Jue Xue
- J. Global Optimization
- 1994

In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is also provided.

- Christodoulos A. Floudas, Panos M. Pardalos
- Lecture Notes in Computer Science
- 1990

- Yong Li, Panos M. Pardalos, Mauricio G. C. Resende
- Quadratic Assignment and Related Problems
- 1993

A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems. In this paper, we describe a GRASP for the quadratic assignment problem. We review basic concepts of GRASP: construction and local search algorithms. The… (More)

- Ashwin Arulselvan, Clayton W. Commander, Lily Elefteriadou, Panos M. Pardalos
- Computers & OR
- 2009

Identifying critical nodes in a graph is important to understand the structural characteristics and the connectivity properties of the network. In this paper, we focus on detecting critical nodes, or nodes whose deletion results in the minimum pair-wise connectivity among the remaining nodes. This problem, known as the CRITICAL NODE PROBLEM has applications… (More)

- Faiz A. Al-Khayyal, Panos M. Pardalos
- SIAM Review
- 1991

this map and associated Newton iteration, etc. The map is also the vehicle for proving existence theorems, via the Schauder fixed point theorem. A mathematician who played a decisive and fundamental role in the early development of semiconductor modeling was Michael Sever (nre Mock), who first published in this field in 1972. Computational scientists in… (More)

- Panos M. Pardalos, Stephen A. Vavasis
- J. Global Optimization
- 1991

We show that the problem of minimizing a concave quadratic function with one concave direction is NP-hard. This result can be interpreted as an attempt to understand exactly what makes nonconvex quadratic programming problems hard. Sahni in 1974 [8] showed that quadratic programming with a negative definite quadratic term (n negative eigenvalues) is… (More)

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 dominating set (MCDS) are essential for solving many practical problems, such as finding a minimum size backbone in ad hoc networks. Wireless ad hoc networks appear in a… (More)