The following pages link to Pablo Moscato (Q191620):
Displaying 19 items.
- (Q507597) (redirect page) (← links)
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data (Q507623) (← links)
- (Q588181) (redirect page) (← links)
- An integer programming model for protein structure prediction using the 3D-HP side chain model (Q897607) (← links)
- The Euclidean traveling salesman problem and a space-filling curve (Q1392940) (← links)
- A new memetic algorithm for the asymmetric traveling salesman problem (Q1771206) (← links)
- (Q1861852) (redirect page) (← links)
- A mixed evolutionary-statistical analysis of an algorithm's complexity (Q1861853) (← links)
- The \(k\)-feature set problem is \(W[2]\)-complete (Q1877698) (← links)
- An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search (Q2366996) (← links)
- (Q4418349) (← links)
- (Q4422138) (← links)
- On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem (Q4427335) (← links)
- A Gentle Introduction to Memetic Algorithms (Q4452894) (← links)
- (Q4667329) (← links)
- (Q4667345) (← links)
- (Q4667355) (← links)
- A memetic algorithm for the total tardiness single machine scheduling problem (Q5938406) (← links)
