Search the dblp DataBase
Leonidas S. Pitsoulis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Renata M. Aiex, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
A GRASP for Computing Approximate Solutions for the Three-Index Assignment Problem. [Citation Graph (0, 0)][DBLP]
IPDPS Workshops, 2000, pp:504- [Conf] - Panos M. Pardalos, Leonidas S. Pitsoulis, T. Mavridou, Mauricio G. C. Resende
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP. [Citation Graph (0, 0)][DBLP]
IRREGULAR, 1995, pp:317-331 [Conf] - Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
A Parallel GRASP for MAX-SAT Problems. [Citation Graph (0, 0)][DBLP]
PARA, 1996, pp:575-585 [Conf] - Dimitris Magos, Ioannis Mourtos, Leonidas Pitsoulis
Consistency of the Matching Predicate. [Citation Graph (0, 0)][DBLP]
SETN, 2006, pp:555-558 [Conf] - Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
WEA, 2005, pp:367-379 [Conf] - Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2000, v:100, n:1-2, pp:95-113 [Journal] - Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
GRASP with path relinking for the weighted MAXSAT problem. [Citation Graph (0, 0)][DBLP]
ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal] - Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
Algorithm 769: Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems Using GRASP. [Citation Graph (0, 0)][DBLP]
ACM Trans. Math. Softw., 1997, v:23, n:2, pp:196-208 [Journal]
Regular Matroids with Graphic Cocircuits [Citation Graph (, )][DBLP]
On the representability of totally unimodular matrices on bidirected graphs. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002