- Home
- Best Scientists - Mathematics
- Alberto Caprara

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
53
Citations
9,187
129
World Ranking
666
National Ranking
14

Engineering and Technology
D-index
53
Citations
9,206
129
World Ranking
1727
National Ranking
46

- Algorithm
- Mathematical optimization
- Linear programming

His primary scientific interests are in Discrete mathematics, Algorithm, Combinatorics, Mathematical optimization and Operations research. His research integrates issues of Approximation algorithm and Knapsack problem in his study of Discrete mathematics. When carried out as part of a general Algorithm research project, his work on Heuristic and Dynamic programming is frequently linked to work in Auxiliary memory, therefore connecting diverse disciplines of study.

Many of his research projects under Combinatorics are closely connected to Upper and lower bounds with Upper and lower bounds, tying the diverse disciplines of science together. His work on Heuristics and Column generation as part of general Mathematical optimization research is frequently linked to Track, bridging the gap between disciplines. His Operations research research is multidisciplinary, relying on both Scheduling, Crew scheduling and Transport engineering.

- Modeling and Solving the Train Timetabling Problem (368 citations)
- A Heuristic Method for the Set Covering Problem (359 citations)
- Algorithms for the Set Covering Problem (316 citations)

Alberto Caprara mainly investigates Mathematical optimization, Combinatorics, Discrete mathematics, Algorithm and Linear programming. His work in Integer programming, Column generation, Lagrangian relaxation, Heuristic and Branch and bound is related to Mathematical optimization. In general Integer programming study, his work on Cutting-plane method often relates to the realm of Train, thereby connecting several areas of interest.

His Combinatorics research focuses on Bin packing problem and how it relates to Packing problems. The concepts of his Discrete mathematics study are interwoven with issues in Subset sum problem, Continuous knapsack problem, Knapsack problem and Set packing. His study of Sorting is a part of Algorithm.

- Mathematical optimization (38.97%)
- Combinatorics (36.03%)
- Discrete mathematics (27.21%)

- Mathematical optimization (38.97%)
- Knapsack problem (16.91%)
- Discrete mathematics (27.21%)

His primary areas of investigation include Mathematical optimization, Knapsack problem, Discrete mathematics, Algorithm and Assignment problem. In the subject of general Mathematical optimization, his work in Column generation, Integer programming, Lagrangian relaxation and Heuristic is often linked to Upper and lower bounds, thereby combining diverse domains of study. His work carried out in the field of Integer programming brings together such families of science as Benders' decomposition, Complex system and Heuristic.

His research ties Combinatorics and Discrete mathematics together. Alberto Caprara studies Linear programming which is a part of Algorithm. His Assignment problem research integrates issues from Bounding overwatch and Operations research.

- A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling (69 citations)
- Railway Rolling Stock Planning: Robustness Against Large Disruptions (52 citations)
- An effective branch-and-bound algorithm for convex quadratic integer programming (43 citations)

- Mathematical optimization
- Algorithm
- Linear programming

Alberto Caprara spends much of his time researching Mathematical optimization, Knapsack problem, Continuous knapsack problem, Cutting stock problem and Time complexity. In the field of Mathematical optimization, his study on Optimization problem, Stochastic programming and Iterative method overlaps with subjects such as Stock and Total cost. The various areas that he examines in his Optimization problem study include Linear programming, Heuristic, Benders' decomposition and Integer programming.

His work on Change-making problem as part of general Knapsack problem study is frequently connected to Stackelberg competition, Interdiction and Simple, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. The Continuous knapsack problem study combines topics in areas such as Computational complexity theory, Polynomial hierarchy, Polynomial-time approximation scheme and Combinatorics. The subject of his Time complexity research is within the realm of Discrete mathematics.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Modeling and Solving the Train Timetabling Problem

Alberto Caprara;Matteo Fischetti;Paolo Toth.

Operations Research **(2002)**

672 Citations

A Heuristic Method for the Set Covering Problem

Alberto Caprara;Matteo Fischetti;Paolo Toth.

Operations Research **(1999)**

586 Citations

Algorithms for the Set Covering Problem

Alberto Caprara;Paolo Toth;Matteo Fischetti.

Annals of Operations Research **(2000)**

534 Citations

Passenger Railway Optimization

Alberto Caprara;Leo Kroon;Michele Monaci;Marc Peeters.

Discrete optimization / edited by K. Aardal, G.L. Nemhauser, R. Weismantel. -- **(2007)**

358 Citations

Sorting by reversals is difficult

Alberto Caprara.

research in computational molecular biology **(1997)**

351 Citations

Algorithms for railway crew management

Alberto Caprara;Matteo Fischetti;Paolo Toth;Daniele Vigo.

Mathematical Programming **(1997)**

308 Citations

Sorting Permutations by Reversals and Eulerian Cycle Decompositions

Alberto Caprara.

SIAM Journal on Discrete Mathematics **(1999)**

294 Citations

A Lagrangian heuristic algorithm for a real-world train timetabling problem

Alberto Caprara;Michele Monaci;Paolo Toth;Pier Luigi Guida.

Discrete Applied Mathematics **(2006)**

272 Citations

Exact Solution of the Quadratic Knapsack Problem

Alberto Caprara;David Pisinger;Paolo Toth.

Informs Journal on Computing **(1999)**

254 Citations

Modeling and Solving the Crew Rostering Problem

Alberto Caprara;Paolo Toth;Daniele Vigo;Matteo Fischetti.

Operations Research **(1998)**

245 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

University of Bologna

University of Padua

University of Bologna

Polytechnique Montréal

Erasmus University Rotterdam

ETH Zurich

Sapienza University of Rome

University of Bologna

Yahoo (United States)

University of Parma

Carnegie Mellon University

Northeastern University

IBM (United States)

University of Manitoba

Tokyo Institute of Technology

Tianjin University

University of Amsterdam

University of California, Davis

Aix-Marseille University

University of California, San Diego

University of Queensland

Washington State University

TU Dresden

University of Notre Dame

Baylor College of Medicine

University of Southern California

Something went wrong. Please try again later.