Giuseppe Lancia

From MaRDI portal
Person:301941

Available identifiers

zbMath Open lancia.giuseppe-gMaRDI QIDQ301941

List of research outcomes

PublicationDate of PublicationType
Proving hamiltonian properties in connected 4-regular graphs: an ILP-based approach2021-12-09Paper
Using integer programming to search for counterexamples: a case study2021-04-19Paper
Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood2020-12-15Paper
\texttt{FASTSET}: a fast data structure for the representation of sets of integers2020-10-07Paper
Finding the largest triangle in a graph in expected quadratic time2020-05-27Paper
Ramsey theory and integrality gap for the independent set problem2018-08-27Paper
Mathematical programming in computational biology: an annotated bibliography2018-08-20Paper
Local search inequalities2018-05-24Paper
Compact extended linear programming models2018-01-31Paper
Separating sets of strings by finding matching patterns is almost always hard2017-02-06Paper
Deriving compact extended formulations via LP-based separation techniques2016-07-22Paper
Estimating the strength of poker hands by integer linear programming techniques2016-07-04Paper
Algorithmic approaches for the single individual haplotyping problem2016-05-11Paper
Mathematical Models and Solutions for the Analysis of Human Genotypes2015-10-07Paper
Deriving compact extended formulations via LP-based separation techniques2014-12-17Paper
An effective compact formulation of the max cut problem on sparse graphs2013-07-23Paper
A Set-Covering Approach with Column Generation for Parsimony Haplotyping2012-07-28Paper
Opportunities for Combinatorial Optimization in Computational Biology2012-06-08Paper
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms2012-06-08Paper
Sorting Permutations by Reversals Through Branch-and-Price2012-05-30Paper
A time-indexed LP-based approach for min-sum job-shop problems2011-11-17Paper
FLIPPING LETTERS TO MINIMIZE THE SUPPORT OF A STRING2008-11-03Paper
The phasing of heterozygous traits: Algorithms and complexity2008-06-12Paper
https://portal.mardi4nfdi.de/entity/Q54570892008-04-14Paper
https://portal.mardi4nfdi.de/entity/Q54942252006-10-17Paper
A polynomial case of the parsimony haplotyping problem2006-06-30Paper
https://portal.mardi4nfdi.de/entity/Q30248012005-07-04Paper
Polynomial and APX-hard cases of the individual haplotyping problem2005-06-10Paper
Compact optimization can outperform separation: a case study in structural proteomics2005-02-11Paper
https://portal.mardi4nfdi.de/entity/Q31581092005-01-20Paper
https://portal.mardi4nfdi.de/entity/Q44324022003-10-22Paper
https://portal.mardi4nfdi.de/entity/Q44081012003-07-02Paper
https://portal.mardi4nfdi.de/entity/Q47967052003-03-20Paper
Compact vs. exponential-size LP relaxations2002-08-28Paper
Exact algorithms for minimum routing cost trees2002-07-01Paper
https://portal.mardi4nfdi.de/entity/Q42467872002-01-03Paper
https://portal.mardi4nfdi.de/entity/Q49526292001-07-04Paper
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan2001-01-30Paper
https://portal.mardi4nfdi.de/entity/Q49525932000-05-10Paper
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees2000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q42501592000-02-09Paper
Genotyping of pooled microsatellite markers by combinatorial optimization techniques1999-11-03Paper
Job shop scheduling with deadlines1998-04-13Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Giuseppe Lancia