The following pages link to Giuseppe Lancia (Q301941):
Displayed 43 items.
- Estimating the strength of poker hands by integer linear programming techniques (Q301942) (← links)
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- The phasing of heterozygous traits: Algorithms and complexity (Q929162) (← links)
- Genotyping of pooled microsatellite markers by combinatorial optimization techniques (Q1281777) (← links)
- Job shop scheduling with deadlines (Q1383797) (← links)
- Compact vs. exponential-size LP relaxations (Q1612003) (← links)
- Mathematical programming in computational biology: an annotated bibliography (Q1662439) (← links)
- Ramsey theory and integrality gap for the independent set problem (Q1667206) (← links)
- Compact extended linear programming models (Q1693865) (← links)
- Local search inequalities (Q1751111) (← links)
- Compact optimization can outperform separation: a case study in structural proteomics (Q1762887) (← links)
- Polynomial and APX-hard cases of the individual haplotyping problem (Q1781994) (← links)
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830) (← links)
- \texttt{FASTSET}: a fast data structure for the representation of sets of integers (Q2004853) (← links)
- Finding the largest triangle in a graph in expected quadratic time (Q2184135) (← links)
- Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood (Q2216018) (← links)
- A polynomial case of the parsimony haplotyping problem (Q2494824) (← links)
- Using integer programming to search for counterexamples: a case study (Q2663722) (← links)
- Algorithmic approaches for the single individual haplotyping problem (Q2805490) (← links)
- An effective compact formulation of the max cut problem on sparse graphs (Q2840693) (← links)
- Sorting Permutations by Reversals Through Branch-and-Price (Q2884508) (← links)
- Opportunities for Combinatorial Optimization in Computational Biology (Q2890421) (← links)
- Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms (Q2890436) (← links)
- A Set-Covering Approach with Column Generation for Parsimony Haplotyping (Q2901055) (← links)
- Mathematical Models and Solutions for the Analysis of Human Genotypes (Q2948975) (← links)
- (Q3024801) (← links)
- (Q3158109) (← links)
- FLIPPING LETTERS TO MINIMIZE THE SUPPORT OF A STRING (Q3532136) (← links)
- (Q4246787) (← links)
- (Q4250159) (← links)
- (Q4408101) (← links)
- (Q4432402) (← links)
- Exact algorithms for minimum routing cost trees (Q4537623) (← links)
- (Q4796705) (← links)
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees (Q4943844) (← links)
- (Q4952593) (← links)
- (Q4952629) (← links)
- (Q5457089) (← links)
- (Q5494225) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
- Proving hamiltonian properties in connected 4-regular graphs: an ILP-based approach (Q6385244) (← links)