LANCIA, Giuseppe
LANCIA, Giuseppe
DMIF - DIPARTIMENTO DI SCIENZE MATEMATICHE, INFORMATICHE E FISICHE
1001 optimal PDB structure alignments: Integer Programming methods for finding the maximum contact map overlap
2004-01-01 Caprara, A.; Carr, R.; Istrail, S.; Lancia, Giuseppe; Walenz, B.
101 Optimal PDB Structure Alignments: a Branch-And-Cut Algorithm for the Maximum Contact Map Overlap Problem
2001-01-01 Lancia, Giuseppe; Carr, R. D.; Walenz, B.; Istrail, S.
A Column-Generation Based Branch-and-Bound Algorithm for Sorting By Reversals
1999-01-01 Caprara, A.; Lancia, Giuseppe; Ng, S. K.
A compact optimization approach for jobshop problems
2007-01-01 Lancia, Giuseppe; Rinaldi, Franca; Serafini, Paolo
A Facility Location Model for Air Pollution Detection
2018-01-01 Lancia, Giuseppe; Rinaldi, Franca; Serafini, Paolo
A polynomial case of the parsimony haplotyping problem
2006-01-01 Lancia, Giuseppe; Rizzi, R.
A polynomial-time approximation scheme for minimum routing cost spanning trees
2000-01-01 Wu, B. Y.; Lancia, G.; Bafna, V.; Chao, K. -M.; Ravi, R.; Tang, C. Y.
A Polynomial-time Approximation Scheme for the Minimum Routing Cost Tree Problem
1999-01-01 Wu, B. Y.; Lancia, Giuseppe; Bafna, V.; Chao, K. M.; Ravi, R.; Tang, C. Y.
A set covering approach with column generation for parsimony haplotyping
2009-01-01 Lancia, Giuseppe; Serafini, Paolo
A tabu search procedure for the TSP with time windows
2010-01-01 Lancia, Giuseppe; Nadalin, Francesca; Rinaldi, Franca
A time indexed model for Open Shop and Job Shop with three operations
2014-01-01 Lancia, Giuseppe; Rinaldi, Franca; Serafini, Paolo
A time-indexed LP-based approach for min-sum job-shop problems
2011-01-01 Lancia, Giuseppe; Rinaldi, Franca; Serafini, Paolo
A unified integer programming model for genome rearrangement problems
2015-01-01 Lancia, Giuseppe; Rinaldi, Franca; Serafini, Paolo
Alberto Caprara (1968-2012): Scientific Contributions
2013-01-01 Nikhil, Bansal; Matteo, Fischetti; Adam, Letchford; Andrea, Lodi; Lancia, Giuseppe; Michele, Monaci; Ulrich, Pferschy; David, Pisinger; Juan Jose, Salazar; Maxim, Sviridenko; Paolo, Toth
Algorithmic approaches for the single individual haplotyping problem
2016-01-01 Lancia, Giuseppe
Algorithmic strategies for a fast exploration of the TSP 4 -OPT neighborhood
2023-01-01 Lancia, G.; Dalpasso, M.
Algorithmic Strategies for a Fast Exploration of the TSP 4-OPT Neighborhood
2019-01-01 Lancia, Giuseppe; Dalpasso, Marcello
Algorithmic strategies for the SNPs haplotype assembly problem
2002-01-01 Lippert, R.; Schwartz, R.; Lancia, Giuseppe; Istrail, S.
Algorithmic Strategies in Combinatorial Chemistry
2000-01-01 Goldman, D.; Istrail, S.; Lancia, Giuseppe; Piccolboni, A.; Walenz, B.
Algorithms and Data Structures for Next Generation Sequences
2014-01-01 Vezzi, Francesco; Lancia, Giuseppe; Policriti, Alberto
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| 1001 optimal PDB structure alignments: Integer Programming methods for finding the maximum contact map overlap | 1-gen-2004 | Caprara, A.; Carr, R.; Istrail, S.; Lancia, Giuseppe; Walenz, B. | |
| 101 Optimal PDB Structure Alignments: a Branch-And-Cut Algorithm for the Maximum Contact Map Overlap Problem | 1-gen-2001 | Lancia, Giuseppe; Carr, R. D.; Walenz, B.; Istrail, S. | |
| A Column-Generation Based Branch-and-Bound Algorithm for Sorting By Reversals | 1-gen-1999 | Caprara, A.; Lancia, Giuseppe; Ng, S. K. | |
| A compact optimization approach for jobshop problems | 1-gen-2007 | Lancia, Giuseppe; Rinaldi, Franca; Serafini, Paolo | |
| A Facility Location Model for Air Pollution Detection | 1-gen-2018 | Lancia, Giuseppe; Rinaldi, Franca; Serafini, Paolo | |
| A polynomial case of the parsimony haplotyping problem | 1-gen-2006 | Lancia, Giuseppe; Rizzi, R. | |
| A polynomial-time approximation scheme for minimum routing cost spanning trees | 1-gen-2000 | Wu, B. Y.; Lancia, G.; Bafna, V.; Chao, K. -M.; Ravi, R.; Tang, C. Y. | |
| A Polynomial-time Approximation Scheme for the Minimum Routing Cost Tree Problem | 1-gen-1999 | Wu, B. Y.; Lancia, Giuseppe; Bafna, V.; Chao, K. M.; Ravi, R.; Tang, C. Y. | |
| A set covering approach with column generation for parsimony haplotyping | 1-gen-2009 | Lancia, Giuseppe; Serafini, Paolo | |
| A tabu search procedure for the TSP with time windows | 1-gen-2010 | Lancia, Giuseppe; Nadalin, Francesca; Rinaldi, Franca | |
| A time indexed model for Open Shop and Job Shop with three operations | 1-gen-2014 | Lancia, Giuseppe; Rinaldi, Franca; Serafini, Paolo | |
| A time-indexed LP-based approach for min-sum job-shop problems | 1-gen-2011 | Lancia, Giuseppe; Rinaldi, Franca; Serafini, Paolo | |
| A unified integer programming model for genome rearrangement problems | 1-gen-2015 | Lancia, Giuseppe; Rinaldi, Franca; Serafini, Paolo | |
| Alberto Caprara (1968-2012): Scientific Contributions | 1-gen-2013 | Nikhil, Bansal; Matteo, Fischetti; Adam, Letchford; Andrea, Lodi; Lancia, Giuseppe; Michele, Monaci; Ulrich, Pferschy; David, Pisinger; Juan Jose, Salazar; Maxim, Sviridenko; Paolo, Toth | |
| Algorithmic approaches for the single individual haplotyping problem | 1-gen-2016 | Lancia, Giuseppe | |
| Algorithmic strategies for a fast exploration of the TSP 4 -OPT neighborhood | 1-gen-2023 | Lancia, G.; Dalpasso, M. | |
| Algorithmic Strategies for a Fast Exploration of the TSP 4-OPT Neighborhood | 1-gen-2019 | Lancia, Giuseppe; Dalpasso, Marcello | |
| Algorithmic strategies for the SNPs haplotype assembly problem | 1-gen-2002 | Lippert, R.; Schwartz, R.; Lancia, Giuseppe; Istrail, S. | |
| Algorithmic Strategies in Combinatorial Chemistry | 1-gen-2000 | Goldman, D.; Istrail, S.; Lancia, Giuseppe; Piccolboni, A.; Walenz, B. | |
| Algorithms and Data Structures for Next Generation Sequences | 1-gen-2014 | Vezzi, Francesco; Lancia, Giuseppe; Policriti, Alberto |