Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design. - Alberto Caprara; Matteo Fischetti; Dario Maio (IEEE Trans. Knowl. Data Eng., 1995)

A Heuristic Algorithm for the Set Covering Problem. - Alberto Caprara; Matteo Fischetti; Paolo Toth (IPCO, 1996)

{0, 1/2}-Chvátal-Gomory cuts. - Alberto Caprara; Matteo Fischetti (Math. Program., 1996)

Sorting by reversals is difficult. - Alberto Caprara (RECOMB, 1997)

Algorithms for railway crew management. - Alberto Caprara; Matteo Fischetti; Paolo Toth; Daniele Vigo; Pier Luigi Guida (Math. Program., 1997)

A column-generation based branch-and-bound algorithm for sorting by reversals. - Alberto Caprara; Giuseppe Lancia; See-Kiong Ng (Mathematical Support for Molecular Biology, 1998)

Properties of some ILP Formulations of a Class of Partitioning Problems. - Alberto Caprara (Discret. Appl. Math., 1998)

Modeling and Solving the Crew Rostering Problem. - Alberto Caprara; Paolo Toth; Daniele Vigo; Matteo Fischetti (Oper. Res., 1998)

Improving a Family of Approximation Algorithms to Edge Color Multigraphs. - Alberto Caprara; Romeo Rizzi (Inf. Process. Lett., 1998)

Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem. - Alberto Caprara; Filippo Focacci; Evelina Lamma; Paola Mello; Michela Milano; Paolo Toth; Daniele Vigo (Softw. Pract. Exp., 1998)

On the Separation of Maximally Violated mod-k Cuts. - Alberto Caprara; Matteo Fischetti; Adam N. Letchford (IPCO, 1999)

Formulations and hardness of multiple sorting by reversals. - Alberto Caprara (RECOMB, 1999)

Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem. - Alberto Caprara; Juan José Salazar González (Discret. Appl. Math., 1999)

Exact Solution of the Quadratic Knapsack Problem. - Alberto Caprara; David Pisinger; Paolo Toth (INFORMS J. Comput., 1999)

A Heuristic Method for the Set Covering Problem. - Alberto Caprara; Matteo Fischetti; Paolo Toth (Oper. Res., 1999)

On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals. - Alberto Caprara (J. Comb. Optim., 1999)

Sorting Permutations by Reversals and Eulerian Cycle Decompositions. - Alberto Caprara (SIAM J. Discret. Math., 1999)

Fast practical solution of sorting by reversals. - Alberto Caprara; Giuseppe Lancia; See-Kiong Ng (SODA, 2000)

Algorithms for the Set Covering Problem. - Alberto Caprara; Paolo Toth; Matteo Fischetti (Ann. Oper. Res., 2000)

Approximation algorithms for knapsack problems with cardinality constraints. - Alberto Caprara; Hans Kellerer; Ulrich Pferschy; David Pisinger (Eur. J. Oper. Res., 2000)

A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. - Alberto Caprara; Hans Kellerer; Ulrich Pferschy (Inf. Process. Lett., 2000)

On the separation of maximally violated mod- k cuts. - Alberto Caprara; Matteo Fischetti; Adam N. Letchford (Math. Program., 2000)

The Multiple Subset Sum Problem. - Alberto Caprara; Hans Kellerer; Ulrich Pferschy (SIAM J. Optim., 2000)

Packing Cycles and Cuts in Undirected Graphs. - Alberto Caprara; Alessandro Panconesi; Romeo Rizzi (ESA, 2001)

Solution of Real-World Train Timetabling Problems. - Alberto Caprara; Matteo Fischetti; Pier Luigi Guida; Michele Monaci; Giuseppe Sacco; Paolo Toth (HICSS, 2001)

Approximation Schemes for Ordered Vector Packing Problems. - Alberto Caprara; Hans Kellerer; Ulrich Pferschy (RANDOM-APPROX, 2001)

On the Practical Solution of the Reversal Median Problem. - Alberto Caprara (WABI, 2001)

Lower bounds and algorithms for the 2-dimensional vector packing problem. - Alberto Caprara; Paolo Toth (Discret. Appl. Math., 2001)

Sorting Permutations by Reversals Through Branch-and-Price. - Alberto Caprara; Giuseppe Lancia; See-Kiong Ng (INFORMS J. Comput., 2001)

Optimal and Near - Optimal Solutions for 3D Structure Comparisons. - Alberto Caprara; Giuseppe Lancia (3DPVT, 2002)

Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. - Ernst Althaus; Alberto Caprara; Hans-Peter Lenhof; Knut Reinert (ECCB, 2002)

Packing 2-Dimensional Bins in Harmony. - Alberto Caprara (FOCS, 2002)

An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. - Alberto Caprara; Andrea Lodi 001; Michele Monaci (IPCO, 2002)

Structural alignment of large-size proteins via lagrangian relaxation. - Alberto Caprara; Giuseppe Lancia (RECOMB, 2002)

On bandwidth-2 graphs. - Alberto Caprara; Federico Malucelli; Daniele Pretolani (Discret. Appl. Math., 2002)

Modeling and Solving the Train Timetabling Problem. - Alberto Caprara; Matteo Fischetti; Paolo Toth (Oper. Res., 2002)

On the stability number of the edge intersection of two graphs. - Claudio Arbib; Alberto Caprara (Inf. Process. Lett., 2002)

Packing triangles in bounded degree graphs. - Alberto Caprara; Romeo Rizzi (Inf. Process. Lett., 2002)

Wavelength rerouting in optical networks, or the Venetian Routing problem. - Alberto Caprara; Giuseppe F. Italiano; Gurusamy Mohan; Alessandro Panconesi; Aravind Srinivasan (J. Algorithms, 2002)

Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. - Alberto Caprara; Romeo Rizzi (J. Comb. Optim., 2002)

Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem. - Alberto Caprara (SIAM J. Optim., 2002)

Polynomial-time algorithm for on-chip scratchpad memory partitioning. - Federico Angiolini; Luca Benini; Alberto Caprara (CASES, 2003)

A 3/4-Approximation Algorithm for Multiple Subset Sum. - Alberto Caprara; Hans Kellerer; Ulrich Pferschy (J. Heuristics, 2003)

The Reversal Median Problem. - Alberto Caprara (INFORMS J. Comput., 2003)

Packing cycles in undirected graphs. - Alberto Caprara; Alessandro Panconesi; Romeo Rizzi (J. Algorithms, 2003)

On the separation of split cuts and related inequalities. - Alberto Caprara; Adam N. Letchford (Math. Program., 2003)

Models and algorithms for a staff scheduling problem. - Alberto Caprara; Michele Monaci; Paolo Toth (Math. Program., 2003)

Knapsack problems: A book review. - Alberto Caprara (4OR, 2004)

1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap. - Alberto Caprara; Robert D. Carr; Sorin Istrail; Giuseppe Lancia; Brian Walenz (J. Comput. Biol., 2004)

On d-threshold graphs and d-dimensional bin packing. - Alberto Caprara; Andrea Lodi 001; Romeo Rizzi (Networks, 2004)

Packing cuts in undirected graphs. - Alberto Caprara; Alessandro Panconesi; Romeo Rizzi (Networks, 2004)

Book reviews. - Alberto Caprara (Oper. Res. Lett., 2004)

On the two-dimensional Knapsack Problem. - Alberto Caprara; Michele Monaci (Oper. Res. Lett., 2004)

Worst-case analysis of the subset sum algorithm for bin packing. - Alberto Caprara; Ulrich Pferschy (Oper. Res. Lett., 2004)

Bidimensional Packing by Bilinear Programming. - Alberto Caprara; Marco Locatelli 001; Michele Monaci (IPCO, 2005)

Laying Out Sparse Graphs with Provably Minimum Bandwidth. - Alberto Caprara; Juan José Salazar González (INFORMS J. Comput., 2005)

Modified subset sum heuristics for bin packing. - Alberto Caprara; Ulrich Pferschy (Inf. Process. Lett., 2005)

Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing. - Alberto Caprara; Andrea Lodi 001; Michele Monaci (Math. Oper. Res., 2005)

An efficient profile-based algorithm for scratchpad memory partitioning. - Federico Angiolini; Luca Benini; Alberto Caprara (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2005)

Improved approximation algorithms for multidimensional bin packing problems. - Nikhil Bansal 001; Alberto Caprara; Maxim Sviridenko (FOCS, 2006)

A Lagrangian heuristic algorithm for a real-world train timetabling problem. - Alberto Caprara; Michele Monaci; Paolo Toth; Pier Luigi Guida (Discret. Appl. Math., 2006)

Packing into the smallest square: Worst-case analysis of lower bounds. - Alberto Caprara; Andrea Lodi 001; Silvano Martello; Michele Monaci (Discret. Optim., 2006)

A branch-and-cut algorithm for multiple sequence alignment. - Ernst Althaus; Alberto Caprara; Hans-Peter Lenhof; Knut Reinert (Math. Program., 2006)

Chapter 3 Passenger Railway Optimization. - Alberto Caprara; Leo G. Kroon; Michele Monaci; Marc Peeters; Paolo Toth (Transportation, 2007)

Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study. - Giuseppe Andreello; Alberto Caprara; Matteo Fischetti (INFORMS J. Comput., 2007)

Recoverable Robustness for Railway Rolling Stock Planning. - Valentina Cacchiani; Alberto Caprara; Laura Galli; Leo G. Kroon; Gábor Maróti (ATMOS, 2008)

An Application of Network Design with Orientation Constraints. - Alberto Caprara; Emiliano Traversi; Joerg Schweizer (CTW, 2008)

A column generation approach to train timetabling on a corridor. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (4OR, 2008)

A New Lower Bound for the Minimum Linear Arrangement of a Graph. - André Renato Sales Amaral; Alberto Caprara; Adam N. Letchford; Juan José Salazar González (Electron. Notes Discret. Math., 2008)

Constrained 0-1 quadratic programming: Basic approaches and extensions. - Alberto Caprara (Eur. J. Oper. Res., 2008)

Packing d-Dimensional Bins in d Stages. - Alberto Caprara (Math. Oper. Res., 2008)

Robustness in Train Timetabling. - Valentina Cacchiani; Alberto Caprara; Matteo Fischetti (CTW, 2009)

A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. - Nikhil Bansal 001; Alberto Caprara; Klaus Jansen; Lars Prädel; Maxim Sviridenko (ISAAC, 2009)

Bidimensional packing by bilinear programming. - Alberto Caprara; Michele Monaci (Math. Program., 2009)

A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing. - Nikhil Bansal 001; Alberto Caprara; Maxim Sviridenko (SIAM J. Comput., 2009)

Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation. - Alberto Caprara (ATMOS, 2010)

Robust Train Routing and Online Re-scheduling. - Alberto Caprara; Laura Galli; Leo G. Kroon; Gábor Maróti; Paolo Toth (ATMOS, 2010)

Variability-tolerant run-time workload allocation for MPSoC energy minimization under real-time constraints. - Francesco Paterna; Andrea Acquaviva; Alberto Caprara; Francesco Papariello; Giuseppe Desoli; Luca Benini (Conf. Computing Frontiers, 2010)

A Heuristic Algorithm for the Train-Unit Assignment Problem. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (CTW, 2010)

Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program. - Federico Bizzarri; Christoph Buchheim; Sergio Callegari; Alberto Caprara; Andrea Lodi 001; Riccardo Rovatti; Gianluca Setti (CSDM, 2010)

An approximation scheme for the two-stage, two-dimensional knapsack problem. - Alberto Caprara; Andrea Lodi 001; Michele Monaci (Discret. Optim., 2010)

Lower Bounds for the Minimum Linear Arrangement of a Graph. - Alberto Caprara; Adam N. Letchford; Juan José Salazar González (Electron. Notes Discret. Math., 2010)

Solving a real-world train-unit assignment problem. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (Math. Program., 2010)

New techniques for cost sharing in combinatorial optimization games. - Alberto Caprara; Adam N. Letchford (Math. Program., 2010)

Global optimization problems and domain reduction strategies. - Alberto Caprara; Marco Locatelli 001 (Math. Program., 2010)

Non-cyclic train timetabling and comparability graphs. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (Oper. Res. Lett., 2010)

Frontmatter, Table of Contents, Preface, Workshop Organization. - Alberto Caprara; Spyros C. Kontogiannis (ATMOS, 2011)

An efficient on-line task allocation algorithm for QoS and energy efficiency in multicore multimedia platforms. - Francesco Paterna; Andrea Acquaviva; Alberto Caprara; Francesco Papariello; Giuseppe Desoli; Luca Benini (DATE, 2011)

Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. - Martin Bergner; Alberto Caprara; Fabio Furini; Marco E. Lübbecke; Enrico Malaguti; Emiliano Traversi (IPCO, 2011)

Decorous Lower Bounds for Minimum Linear Arrangement. - Alberto Caprara; Adam N. Letchford; Juan José Salazar González (INFORMS J. Comput., 2011)

Optimal linear arrangements using betweenness variables. - Alberto Caprara; Marcus Oswald; Gerhard Reinelt; Robert Schwarz; Emiliano Traversi (Math. Program. Comput., 2011)

Solution of the Train Platforming Problem. - Alberto Caprara; Laura Galli; Paolo Toth (Transp. Sci., 2011)

A Freight Service Design Problem for a Railway Corridor. - Alberto Caprara; Enrico Malaguti; Paolo Toth (Transp. Sci., 2011)

A Fast Heuristic Algorithm for the Train Unit Assignment Problem. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (ATMOS, 2012)

Models and Algorithms for the Train Unit Assignment Problem. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (ISCO, 2012)

An effective branch-and-bound algorithm for convex quadratic integer programming. - Christoph Buchheim; Alberto Caprara; Andrea Lodi 001 (Math. Program., 2012)

Variability-Aware Task Allocation for Energy-Efficient Quality of Service Provisioning in Embedded Streaming Multimedia Applications. - Francesco Paterna; Andrea Acquaviva; Alberto Caprara; Francesco Papariello; Giuseppe Desoli; Luca Benini (IEEE Trans. Computers, 2012)

A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling. - Valentina Cacchiani; Alberto Caprara; Matteo Fischetti (Transp. Sci., 2012)

Railway Rolling Stock Planning: Robustness Against Large Disruptions. - Valentina Cacchiani; Alberto Caprara; Laura Galli; Leo G. Kroon; Gábor Maróti; Paolo Toth (Transp. Sci., 2012)

A Complexity and Approximability Study of the Bilevel Knapsack Problem. - Alberto Caprara; Margarida Carvalho; Andrea Lodi 001; Gerhard J. Woeginger (IPCO, 2013)

A new lower bound for curriculum-based course timetabling. - Valentina Cacchiani; Alberto Caprara; Roberto Roberti; Paolo Toth (Comput. Oper. Res., 2013)

A Lagrangian heuristic for a train-unit assignment problem. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (Discret. Appl. Math., 2013)

Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem. - Alberto Caprara; Fabio Furini; Enrico Malaguti (INFORMS J. Comput., 2013)

Finding cliques of maximum weight on a generalization of permutation graphs. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (Optim. Lett., 2013)

On integer polytopes with few nonzero vertices. - Valentina Cacchiani; Alberto Caprara; Gábor Maróti; Paolo Toth (Oper. Res. Lett., 2013)

Delay-Robust Event Scheduling. - Alberto Caprara; Laura Galli; Sebastian Stiller; Paolo Toth (Oper. Res., 2014)

A Study on the Computational Complexity of the Bilevel Knapsack Problem. - Alberto Caprara; Margarida Carvalho; Andrea Lodi 001; Gerhard J. Woeginger (SIAM J. Optim., 2014)

Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics. - Alberto Caprara; Fabio Furini; Andrea Lodi 001; Mauro Mangia; Riccardo Rovatti; Gianluca Setti (IEEE Trans. Signal Process., 2014)

Automatic Dantzig-Wolfe reformulation of mixed integer programs. - Martin Bergner; Alberto Caprara; Alberto Ceselli; Fabio Furini; Marco E. Lübbecke; Enrico Malaguti; Emiliano Traversi (Math. Program., 2015)

Friendly bin packing instances without Integer Round-up Property. - Alberto Caprara; Mauro Dell'Amico; José Carlos Díaz Díaz; Manuel Iori; Romeo Rizzi (Math. Program., 2015)

Timetabling and assignment problems in railway planning and integer multicommodity flow. - Alberto Caprara (Networks, 2015)

Theoretical and computational results about optimality-based domain reductions. - Alberto Caprara; Marco Locatelli 001; Michele Monaci (Comput. Optim. Appl., 2016)

Bilevel Knapsack with Interdiction Constraints. - Alberto Caprara; Margarida Carvalho; Andrea Lodi 001; Gerhard J. Woeginger (INFORMS J. Comput., 2016)

Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation. - Alberto Caprara; Fabio Furini; Enrico Malaguti; Emiliano Traversi (Inf. Process. Lett., 2016)

An Effective Peak Period Heuristic for Railway Rolling Stock Planning. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (Transp. Sci., 2019)