Pablo Moscato

Available identifiers

Publication	Date of Publication	Type
Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data	2017-02-07	Paper
Separating sets of strings by finding matching patterns is almost always hard	2017-02-06	Paper
An integer programming model for protein structure prediction using the 3D-HP side chain model	2015-12-07	Paper
https://portal.mardi4nfdi.de/entity/Q4667329	2005-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4667345	2005-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4667355	2005-04-19	Paper
A new memetic algorithm for the asymmetric traveling salesman problem	2005-04-07	Paper
The \(k\)-feature set problem is \(W[2]\)-complete	2004-08-19	Paper
A Gentle Introduction to Memetic Algorithms	2004-03-07	Paper
https://portal.mardi4nfdi.de/entity/Q4422138	2003-09-03	Paper
https://portal.mardi4nfdi.de/entity/Q4418349	2003-08-10	Paper
A mixed evolutionary-statistical analysis of an algorithm's complexity	2003-03-10	Paper
A memetic algorithm for the total tardiness single machine scheduling problem	2001-07-18	Paper
The Euclidean traveling salesman problem and a space-filling curve	1999-02-14	Paper
On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem	1998-01-01	Paper
An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search	1993-08-16	Paper

This page was built for person: Pablo Moscato