Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP. - Panos M. Pardalos; Leonidas S. Pitsoulis; Thelma D. Mavridou; Mauricio G. C. Resende (IRREGULAR, 1995)

Approximate solution of weighted MAX-SAT problems using GRASP. - Mauricio G. C. Resende; Leonidas S. Pitsoulis; Panos M. Pardalos (Satisfiability Problem: Theory and Applications, 1996)

A Parallel GRASP for MAX-SAT Problems. - Panos M. Pardalos; Leonidas S. Pitsoulis; Mauricio G. C. Resende (PARA, 1996)

A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. - Robert A. Murphey; Panos M. Pardalos; Leonidas S. Pitsoulis (Network Design: Connectivity and Facilities Location, 1997)

Algorithm 769: Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems Using GRASP. - Panos M. Pardalos; Leonidas S. Pitsoulis; Mauricio G. C. Resende (ACM Trans. Math. Softw., 1997)

A GRASP for the biquadratic assignment problem. - Thelma D. Mavridou; Panos M. Pardalos; Leonidas S. Pitsoulis; Mauricio G. C. Resende (Eur. J. Oper. Res., 1998)

A GRASP for Computing Approximate Solutions for the Three-Index Assignment Problem. - Renata M. Aiex; Panos M. Pardalos; Leonidas S. Pitsoulis; Mauricio G. C. Resende (IPDPS Workshops, 2000)

Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. - Mauricio G. C. Resende; Leonidas S. Pitsoulis; Panos M. Pardalos (Discret. Appl. Math., 2000)

Approximate solutions to the turbine balancing problem. - Leonidas S. Pitsoulis; Panos M. Pardalos; Donald W. Hearn (Eur. J. Oper. Res., 2001)

GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem. - Paola Festa; Panos M. Pardalos; Leonidas S. Pitsoulis; Mauricio G. C. Resende (WEA, 2005)

Branch and bound algorithms for the multidimensional assignment problem. - Eduardo L. Pasiliao; Panos M. Pardalos; Leonidas S. Pitsoulis (Optim. Methods Softw., 2005)

Consistency of the Matching Predicate. - Dimitris Magos; Ioannis Mourtos; Leonidas S. Pitsoulis (SETN, 2006)

The Matching Predicate and a Filtering Scheme Based on Matroids. - Dimitris Magos; Ioannis Mourtos; Leonidas S. Pitsoulis (J. Comput., 2006)

GRASP with path relinking for the weighted MAXSAT problem. - Paola Festa; Panos M. Pardalos; Leonidas S. Pitsoulis; Mauricio G. C. Resende (ACM J. Exp. Algorithmics, 2006)

Optimization with binet matrices. - Gautam Appa; Balázs Kotnyek; Konstantinos Papalamprou; Leonidas S. Pitsoulis (Oper. Res. Lett., 2007)

Quadratic mixed integer programming and support vectors for deleting outliers in robust regression. - George Zioutas; Leonidas S. Pitsoulis; Antonios Avramidis (Ann. Oper. Res., 2009)

Persistency and matroid intersection. - Dimitris Magos; Ioannis Mourtos; Leonidas S. Pitsoulis (Comput. Manag. Sci., 2009)

Regular Matroids with Graphic Cocircuits - Konstantinos Papalamprou; Leonidas S. Pitsoulis (ACAC, 2009)

On the representability of totally unimodular matrices on bidirected graphs. - Leonidas S. Pitsoulis; Konstantinos Papalamprou; Gautam Appa; Balázs Kotnyek (Discret. Math., 2009)

Affine Sets and Functions. - Leonidas S. Pitsoulis (Encyclopedia of Optimization, 2009)

Biquadratic Assignment Problem. - Leonidas S. Pitsoulis (Encyclopedia of Optimization, 2009)

Linear Space. - Leonidas S. Pitsoulis (Encyclopedia of Optimization, 2009)

Quadratic Semi-assignment Problem. - Leonidas S. Pitsoulis (Encyclopedia of Optimization, 2009)

Quadratic Assignment Problem. - Leonidas S. Pitsoulis; Panos M. Pardalos (Encyclopedia of Optimization, 2009)

A fast algorithm for robust regression with penalised trimmed squares. - Leonidas S. Pitsoulis; George Zioutas (Comput. Stat., 2010)

Recognition Algorithms for Binary Signed-Graphic Matroids. - Konstantinos Papalamprou; Leonidas S. Pitsoulis (ISCO, 2012)

Community detection by modularity maximization using GRASP with path relinking. - Mariá Cristina Vasconcelos Nascimento; Leonidas S. Pitsoulis (Comput. Oper. Res., 2013)

A new greedy algorithm for the quadratic assignment problem. - Theodoros P. Gevezes; Leonidas S. Pitsoulis (Optim. Lett., 2013)

Decomposition of Binary Signed-Graphic Matroids. - Konstantinos Papalamprou; Leonidas S. Pitsoulis (SIAM J. Discret. Math., 2013)

Recognition of overlap graphs. - Theodoros P. Gevezes; Leonidas S. Pitsoulis (J. Comb. Optim., 2014)

A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem. - Theodoros P. Gevezes; Leonidas S. Pitsoulis (J. Comb. Optim., 2015)

Optimization techniques for robust multivariate location and scatter estimation. - Christos Chatzinakos; Leonidas S. Pitsoulis; George Zioutas (J. Comb. Optim., 2016)

Signed-graphic matroids with all-graphic cocircuits. - Konstantinos Papalamprou; Leonidas S. Pitsoulis (Discret. Math., 2017)

Optimization techniques for multivariate least trimmed absolute deviation estimation. - George Zioutas; Christos Chatzinakos; Tri-Dung Nguyen; Leonidas S. Pitsoulis (J. Comb. Optim., 2017)

k-Sum decomposition of strongly unimodular matrices. - Konstantinos Papalamprou; Leonidas S. Pitsoulis (Optim. Lett., 2017)

Overlapping community detection in networks based on link partitioning and partitioning around medoids. - Alexander Ponomarenko; Leonidas S. Pitsoulis; Marat Shamshetdinov (CoRR, 2019)

Distances on a Graph. - Pierre Miasnikof; Alexander Y. Shestopaloff; Leonidas S. Pitsoulis; Alexander Ponomarenko; Yuri A. Lawryshyn (COMPLEX NETWORKS (1), 2020)

Graph Distances and Clustering. - Pierre Miasnikof; Alexander Y. Shestopaloff; Leonidas S. Pitsoulis; Yuri A. Lawryshyn (CoRR, 2020)

Binary signed-graphic matroids: Representations and recognition algorithms. - Konstantinos Papalamprou; Leonidas S. Pitsoulis; Eleni-Maria E. Vretta (Discret. Math., 2020)

An empirical comparison of connectivity-based distances on a graph and their computational scalability. - Pierre Miasnikof; Alexander Y. Shestopaloff; Leonidas S. Pitsoulis; Alexander Ponomarenko (J. Complex Networks, 2021)

On characterizing the class of cographic signed-graphic matroids. - Konstantinos Papalamprou; Leonidas S. Pitsoulis; Eleni-Maria E. Vretta (Discret. Appl. Math., 2021)

Decomposition of Quaternary Signed-Graphic Matroids. - Konstantinos Papalamprou; Leonidas S. Pitsoulis; Eleni-Maria E. Vretta (SIAM J. Discret. Math., 2024)

A mathematical programming approach for recognizing binet matrices. - Konstantinos Papalamprou; Leonidas S. Pitsoulis; Balázs Kotnyek (Optim. Lett., 2024)