Lancia Giuseppe

Giuseppe Lancia

Information about the author Giuseppe Lancia will soon be added to the site.
Found 12 papers in total
Deriving compact extended formulations via LP-based separation techniques
Deriving compact extended formulations via LP-based separation techniques
2016
The best formulations for some combinatorial optimization problems are integer linear...
A time‐indexed LP‐based approach for min‐sum job‐shop problems
A time‐indexed LP‐based approach for min‐sum job‐shop problems
2011
In this paper we propose two time‐indexed IP formulations for job‐shop...
A Set-Covering Approach with Column Generation for Parsimony Haplotyping
A Set-Covering Approach with Column Generation for Parsimony Haplotyping
2009
We introduce an exact algorithm, based on integer linear programming (ILP), for the...
Opportunities for combinatorial optimization in computational biology
Opportunities for combinatorial optimization in computational biology
2004
This is a survey designed for mathematical programming people who do not know...
Haplotyping populations by pure parsimony: Complexity of exact and approximation algorithms
Haplotyping populations by pure parsimony: Complexity of exact and approximation algorithms
2004
In this paper we address the pure parsimony haplotyping problem: Find a minimum number...
A polynomial case of the parsimony haplotyping problem
A polynomial case of the parsimony haplotyping problem
2006
The parsimony haplotyping problem was shown to be NP-hard when each genotype had...
Integer programming models for computational biology problems
Integer programming models for computational biology problems
2004
The recent years have seen an impressive increase in the use of Integer Programming...
Sorting permutations by reversals through branch-and-price
Sorting permutations by reversals through branch-and-price
2001
We describe an exact algorithm for the problem of sorting a permutation by the minimum...
Exact algorithms for minimum routing cost trees
Exact algorithms for minimum routing cost trees
2002
Given a set of points and distances between them, a basic problem in network design...
Sorting permutations by reversals through branch-and-price
Sorting permutations by reversals through branch-and-price
2001
We describe an exact algorithm for the problem of sorting a permutation by the minimum...
A polynomial-time approximation scheme for minimum routing cost spanning trees
A polynomial-time approximation scheme for minimum routing cost spanning trees
2000
Given an undirected graph with nonnegative costs on the edges, the routing cost of any...
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
2000
In this paper we deal with the problem of assigning a set of n jobs, with release...
Papers per page: