#### Filter Results:

- Full text PDF available (214)

#### Publication Year

1986

2018

- This year (29)
- Last 5 years (174)
- Last 10 years (301)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Data Set Used

#### Method

#### Organism

Learn More

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

- Panos M. Pardalos, Franz Rendl, Henry Wolkowicz
- Quadratic Assignment and Related Problems
- 1993

Quadratic Assignment Problems model many applications in diverse areas such as operations research, parallel and distributed computing , and combinatorial data analysis. In this paper we survey someâ€¦ (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â€¦ (More)

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

The first â‚¬ price and the Â£ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the â‚¬(D) includes 7% for Germany, the â‚¬(A) includes 10% for Austria.â€¦ (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â€¦ (More)

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

- 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â€¦ (More)

- Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende, C. C. Ribeiro
- Optimization Methods and Software
- 2002

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 endpoints inâ€¦ (More)

- Panos M. Pardalos, Gregory P. Rodgers
- Computing
- 1990

In this paper we describe computational experience in solving unconstrained quadratic zero-one problems using a branch and bound algorithm. The algorithm incorporates dynamic preprocessing techniquesâ€¦ (More)

- 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â€¦ (More)