#### Filter Results:

- Full text PDF available (56)

#### Publication Year

1993

2016

- This year (0)
- Last 5 years (15)
- Last 10 years (52)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Alberto Caprara
- RECOMB
- 1997

We prove that the problem of sorting a permutation by the minimum number of reversals is NP-hard, thus answering a major question on the complexity of a problem which has widely been studied in theâ€¦ (More)

- Alberto Caprara, Matteo Fischetti, Paolo Toth
- Operations Research
- 1999

We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The algorithm was initially designed for solving very large scale SCP instances, involving up to 5,000 rows andâ€¦ (More)

- Alberto Caprara
- FOCS
- 2002

- Alberto Caprara, David Pisinger, Paolo Toth
- INFORMS Journal on Computing
- 1999

The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint, where all coeecients are assumed to be nonnegative and all variables areâ€¦ (More)

- Alberto Caprara, Robert D. Carr, Sorin Istrail, Giuseppe Lancia, Brian Walenz
- Journal of Computational Biology
- 2004

Protein structure comparison is a fundamental problem for structural genomics, with applications to drug design, fold prediction, protein clustering, and evolutionary studies. Despite its importance,â€¦ (More)

- Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
- 2006 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the linear programming (LP) relaxation,â€¦ (More)

- Alberto Caprara
- SIAM J. Discrete Math.
- 1999

We analyze the strong relationship among three combinatorial problems, namely the problem of sorting a permutation by the minimum number of reversals (MIN-SBR), the problem of nding the maximumâ€¦ (More)

- Alberto Caprara
- RECOMB
- 1999

We consider two generalizations of signed Sorting By Reversals (SBR), both aimed at formalizing the problem of reconstructing the evolutionary history of a set of species. In particular, we addressâ€¦ (More)

- Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger
- European Journal of Operational Research
- 2000

We address a variant of the classical knapsack problem in which an upper bound is imposed on the number of items that can be selected. This problem arises in the solution of real-life cutting stockâ€¦ (More)

- Alberto Caprara, Paolo Toth
- Discrete Applied Mathematics
- 2001

Given n items, each having, say, a weight and a length, and n identical bins with a weight and a length capacity, the 2-Dimensional Vector Packing Problem (2-DVPP) calls for packing all the itemsâ€¦ (More)