Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alberto Caprara
2010 – today
- 2013
[j66]Valentina Cacchiani, Alberto Caprara, Roberto Roberti, Paolo Toth: A new lower bound for curriculum-based course timetabling. Computers & OR 40(10): 2466-2477 (2013)- [j65]Valentina Cacchiani, Alberto Caprara, Paolo Toth: A Lagrangian heuristic for a train-unit assignment problem. Discrete Applied Mathematics 161(12): 1707-1718 (2013)
- [j64]Valentina Cacchiani, Alberto Caprara, Paolo Toth: Finding cliques of maximum weight on a generalization of permutation graphs. Optimization Letters 7(2): 289-296 (2013)
- [j63]Valentina Cacchiani, Alberto Caprara, Gábor Maróti, Paolo Toth: On integer polytopes with few nonzero vertices. Oper. Res. Lett. 41(1): 74-77 (2013)
- [c36]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger: A Complexity and Approximability Study of the Bilevel Knapsack Problem. IPCO 2013: 98-109
- 2012
- [j62]Christoph Buchheim, Alberto Caprara, Andrea Lodi: An effective branch-and-bound algorithm for convex quadratic integer programming. Math. Program. 135(1-2): 369-395 (2012)
- [j61]Francesco Paterna, Andrea Acquaviva, Alberto Caprara, Francesco Papariello, Giuseppe Desoli, Luca Benini: Variability-Aware Task Allocation for Energy-Efficient Quality of Service Provisioning in Embedded Streaming Multimedia Applications. IEEE Trans. Computers 61(7): 939-953 (2012)
- [j60]Valentina Cacchiani, Alberto Caprara, Matteo Fischetti: A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling. Transportation Science 46(1): 124-133 (2012)
- [j59]Valentina Cacchiani, Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti, Paolo Toth: Railway Rolling Stock Planning: Robustness Against Large Disruptions. Transportation Science 46(2): 217-232 (2012)
- [c35]Valentina Cacchiani, Alberto Caprara, Paolo Toth: A Fast Heuristic Algorithm for the Train Unit Assignment Problem. ATMOS 2012: 1-9
- [c34]Valentina Cacchiani, Alberto Caprara, Paolo Toth: Models and Algorithms for the Train Unit Assignment Problem. ISCO 2012: 24-35
- 2011
- [j58]Alberto Caprara, Adam N. Letchford, Juan José Salazar González: Decorous Lower Bounds for Minimum Linear Arrangement. INFORMS Journal on Computing 23(1): 26-40 (2011)
- [j57]Alberto Caprara, Marcus Oswald, Gerhard Reinelt, Robert Schwarz, Emiliano Traversi: Optimal linear arrangements using betweenness variables. Math. Program. Comput. 3(3): 261-280 (2011)
- [j56]Alberto Caprara, Enrico Malaguti, Paolo Toth: A Freight Service Design Problem for a Railway Corridor. Transportation Science 45(2): 147-162 (2011)
- [j55]Alberto Caprara, Laura Galli, Paolo Toth: Solution of the Train Platforming Problem. Transportation Science 45(2): 246-257 (2011)
- [c33]Alberto Caprara, Spyros C. Kontogiannis: Frontmatter, Table of Contents, Preface, Workshop Organization. ATMOS 2011
- [c32]Francesco Paterna, Andrea Acquaviva, Alberto Caprara, Francesco Papariello, Giuseppe Desoli, Luca Benini: An efficient on-line task allocation algorithm for QoS and energy efficiency in multicore multimedia platforms. DATE 2011: 100-105
- [c31]Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi: Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. IPCO 2011: 39-51
- [e1]Alberto Caprara, Spyros C. Kontogiannis (Eds.): ATMOS 2011 - 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Saarbrücken, Germany, September 8, 2011. OASICS 20, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2011, ISBN 978-3-939897-33-0
- 2010
- [j54]Alberto Caprara, Andrea Lodi, Michele Monaci: An approximation scheme for the two-stage, two-dimensional knapsack problem. Discrete Optimization 7(3): 114-124 (2010)
- [j53]Alberto Caprara, Adam N. Letchford, Juan José Salazar González: Lower Bounds for the Minimum Linear Arrangement of a Graph. Electronic Notes in Discrete Mathematics 36: 843-849 (2010)
- [j52]Alberto Caprara, Adam N. Letchford: New techniques for cost sharing in combinatorial optimization games. Math. Program. 124(1-2): 93-118 (2010)
- [j51]Valentina Cacchiani, Alberto Caprara, Paolo Toth: Solving a real-world train-unit assignment problem. Math. Program. 124(1-2): 207-231 (2010)
- [j50]Alberto Caprara, Marco Locatelli: Global optimization problems and domain reduction strategies. Math. Program. 125(1): 123-137 (2010)
- [j49]Valentina Cacchiani, Alberto Caprara, Paolo Toth: Non-cyclic train timetabling and comparability graphs. Oper. Res. Lett. 38(3): 179-184 (2010)
- [c30]Alberto Caprara: Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation. ATMOS 2010: 1-12
- [c29]Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti, Paolo Toth: Robust Train Routing and Online Re-scheduling. ATMOS 2010: 24-33
- [c28]Francesco Paterna, Andrea Acquaviva, Alberto Caprara, Francesco Papariello, Giuseppe Desoli, Luca Benini: Variability-tolerant run-time workload allocation for MPSoC energy minimization under real-time constraints. Conf. Computing Frontiers 2010: 109-110
- [c27]Valentina Cacchiani, Alberto Caprara, Paolo Toth: A Heuristic Algorithm for the Train-Unit Assignment Problem. CTW 2010: 33-36
- [c26]Federico Bizzarri, Christoph Buchheim, Sergio Callegari, Alberto Caprara, Andrea Lodi, Riccardo Rovatti, Gianluca Setti: Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program. CSDM 2010: 149-160
- [c25]Christoph Buchheim, Alberto Caprara, Andrea Lodi: An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. IPCO 2010: 285-298
2000 – 2009
- 2009
- [j48]Alberto Caprara, Michele Monaci: Bidimensional packing by bilinear programming. Math. Program. 118(1): 75-108 (2009)
- [j47]Nikhil Bansal, Alberto Caprara, Maxim Sviridenko: A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing. SIAM J. Comput. 39(4): 1256-1278 (2009)
- [c24]Valentina Cacchiani, Alberto Caprara, Matteo Fischetti: Robustness in Train Timetabling. CTW 2009: 171-174
- [c23]Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko: A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. ISAAC 2009: 77-86
- 2008
- [j46]Valentina Cacchiani, Alberto Caprara, Paolo Toth: A column generation approach to train timetabling on a corridor. 4OR 6(2): 125-142 (2008)
- [j45]André R. S. Amaral, Alberto Caprara, Adam N. Letchford, Juan José Salazar González: A New Lower Bound for the Minimum Linear Arrangement of a Graph. Electronic Notes in Discrete Mathematics 30: 87-92 (2008)
- [j44]Alberto Caprara: Constrained 0-1 quadratic programming: Basic approaches and extensions. European Journal of Operational Research 187(3): 1494-1503 (2008)
- [j43]
- [c22]Valentina Cacchiani, Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti: Recoverable Robustness for Railway Rolling Stock Planning. ATMOS 2008
- [c21]Alberto Caprara, Emiliano Traversi, Joerg Schweizer: An Application of Network Design with Orientation Constraints. CTW 2008: 16-21
- 2007
- [j42]Giuseppe Andreello, Alberto Caprara, Matteo Fischetti: Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study. INFORMS Journal on Computing 19(2): 229-238 (2007)
- [c20]Valentina Cacchiani, Alberto Caprara, Paolo Toth: Solving a Real-World Train Unit Assignment Problem. ATMOS 2007
- [c19]
- 2006
- [j41]Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida: A Lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Applied Mathematics 154(5): 738-753 (2006)
- [j40]Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci: Packing into the smallest square: Worst-case analysis of lower bounds. Discrete Optimization 3(4): 317-326 (2006)
- [j39]Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert: A branch-and-cut algorithm for multiple sequence alignment. Math. Program. 105(2-3): 387-425 (2006)
- [c18]Nikhil Bansal, Alberto Caprara, Maxim Sviridenko: Improved approximation algorithms for multidimensional bin packing problems. FOCS 2006: 697-708
- 2005
- [j38]Alberto Caprara, Juan José Salazar González: Laying Out Sparse Graphs with Provably Minimum Bandwidth. INFORMS Journal on Computing 17(3): 356-373 (2005)
- [j37]Alberto Caprara, Ulrich Pferschy: Modified subset sum heuristics for bin packing. Inf. Process. Lett. 96(1): 18-23 (2005)
- [j36]Alberto Caprara, Andrea Lodi, Michele Monaci: Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing. Math. Oper. Res. 30(1): 150-172 (2005)
- [j35]Federico Angiolini, Luca Benini, Alberto Caprara: An efficient profile-based algorithm for scratchpad memory partitioning. IEEE Trans. on CAD of Integrated Circuits and Systems 24(11): 1660-1676 (2005)
- [c17]Alberto Caprara, Marco Locatelli, Michele Monaci: Bidimensional Packing by Bilinear Programming. IPCO 2005: 377-391
- 2004
- [j34]
- [j33]Alberto Caprara, Robert D. Carr, Sorin Istrail, Giuseppe Lancia, Brian Walenz: 1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap. Journal of Computational Biology 11(1): 27-52 (2004)
- [j32]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi: Packing cuts in undirected graphs. Networks 44(1): 1-11 (2004)
- [j31]Alberto Caprara, Andrea Lodi, Romeo Rizzi: On d-threshold graphs and d-dimensional bin packing. Networks 44(4): 266-280 (2004)
- [j30]Alberto Caprara, Michele Monaci: On the two-dimensional Knapsack Problem. Oper. Res. Lett. 32(1): 5-14 (2004)
- [j29]Alberto Caprara, Ulrich Pferschy: Worst-case analysis of the subset sum algorithm for bin packing. Oper. Res. Lett. 32(2): 159-166 (2004)
- [j28]
- 2003
- [j27]Alberto Caprara, Hans Kellerer, Ulrich Pferschy: A 3/4-Approximation Algorithm for Multiple Subset Sum. J. Heuristics 9(2): 99-111 (2003)
- [j26]
- [j25]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi: Packing cycles in undirected graphs. J. Algorithms 48(1): 239-256 (2003)
- [j24]Alberto Caprara, Adam N. Letchford: On the separation of split cuts and related inequalities. Math. Program. 94(2-3): 279-294 (2003)
- [j23]Alberto Caprara, Michele Monaci, Paolo Toth: Models and algorithms for a staff scheduling problem. Math. Program. 98(1-3): 445-476 (2003)
- [c16]Federico Angiolini, Luca Benini, Alberto Caprara: Polynomial-time algorithm for on-chip scratchpad memory partitioning. CASES 2003: 318-326
- 2002
- [j22]Alberto Caprara, Federico Malucelli, Daniele Pretolani: On bandwidth-2 graphs. Discrete Applied Mathematics 117(1-3): 1-13 (2002)
- [j21]Alberto Caprara, Matteo Fischetti, Paolo Toth: Modeling and Solving the Train Timetabling Problem. Operations Research 50(5): 851-861 (2002)
- [j20]Claudio Arbib, Alberto Caprara: On the stability number of the edge intersection of two graphs. Inf. Process. Lett. 83(3): 173-174 (2002)
- [j19]Alberto Caprara, Romeo Rizzi: Packing triangles in bounded degree graphs. Inf. Process. Lett. 84(4): 175-180 (2002)
- [j18]Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan: Wavelength rerouting in optical networks, or the Venetian Routing problem. J. Algorithms 45(2): 93-125 (2002)
- [j17]Alberto Caprara, Romeo Rizzi: Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. J. Comb. Optim. 6(2): 157-182 (2002)
- [j16]Alberto Caprara: Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem. SIAM Journal on Optimization 13(2): 508-519 (2002)
- [c15]Alberto Caprara, Giuseppe Lancia: Optimal and Near - Optimal Solutions for 3D Structure Comparisons. 3DPVT 2002: 737-745
- [c14]Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert: Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. ECCB 2002: 4-16
- [c13]
- [c12]Alberto Caprara, Andrea Lodi, Michele Monaci: An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. IPCO 2002: 315-328
- [c11]Alberto Caprara, Giuseppe Lancia: Structural alignment of large-size proteins via lagrangian relaxation. RECOMB 2002: 100-108
- 2001
- [j15]Alberto Caprara, Paolo Toth: Lower bounds and algorithms for the 2-dimensional vector packing problem. Discrete Applied Mathematics 111(3): 231-262 (2001)
- [j14]Alberto Caprara, Giuseppe Lancia, See-Kiong Ng: Sorting Permutations by Reversals Through Branch-and-Price. INFORMS Journal on Computing 13(3): 224-244 (2001)
- [c10]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi: Packing Cycles and Cuts in Undirected Graphs. ESA 2001: 512-523
- [c9]Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth: Solution of Real-World Train Timetabling Problems. HICSS 2001
- [c8]Alberto Caprara, Hans Kellerer, Ulrich Pferschy: Approximation Schemes for Ordered Vector Packing Problems. RANDOM-APPROX 2001: 63-74
- [c7]
- 2000
- [j13]Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger: Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research 123(2): 333-345 (2000)
- [j12]Alberto Caprara, Hans Kellerer, Ulrich Pferschy: A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. Inf. Process. Lett. 73(3-4): 111-118 (2000)
- [j11]Alberto Caprara, Hans Kellerer, Ulrich Pferschy: The Multiple Subset Sum Problem. SIAM Journal on Optimization 11(2): 308-319 (2000)
- [c6]Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan: Wavelength rerouting in optical networks, or the Venetian routing problem. APPROX 2000: 72-83
- [c5]Alberto Caprara, Giuseppe Lancia, See-Kiong Ng: Fast practical solution of sorting by reversals. SODA 2000: 12-21
1990 – 1999
- 1999
- [j10]Alberto Caprara, Juan José Salazar González: Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem. Discrete Applied Mathematics 92(2-3): 111-134 (1999)
- [j9]Alberto Caprara, David Pisinger, Paolo Toth: Exact Solution of the Quadratic Knapsack Problem. INFORMS Journal on Computing 11(2): 125-137 (1999)
- [j8]Alberto Caprara: On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals. J. Comb. Optim. 3(2-3): 149-182 (1999)
- [j7]Alberto Caprara: Sorting Permutations by Reversals and Eulerian Cycle Decompositions. SIAM J. Discrete Math. 12(1): 91-110 (1999)
- [c4]Alberto Caprara, Matteo Fischetti, Adam N. Letchford: On the Separation of Maximally Violated mod-k Cuts. IPCO 1999: 87-98
- [c3]
- 1998
- [j6]Alberto Caprara: Properties of some ILP Formulations of a Class of Partitioning Problems. Discrete Applied Mathematics 87(1-3): 11-23 (1998)
- [j5]Alberto Caprara, Romeo Rizzi: Improving a Family of Approximation Algorithms to Edge Color Multigraphs. Inf. Process. Lett. 68(1): 11-15 (1998)
- [j4]Alberto Caprara, Filippo Focacci, Evelina Lamma, Paola Mello, Michela Milano, Paolo Toth, Daniele Vigo: Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem. Softw., Pract. Exper. 28(1): 49-76 (1998)
- 1997
- [j3]Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida: Algorithms for railway crew management. Math. Program. 79: 125-141 (1997)
- [c2]
- 1996
- [j2]
- [c1]Alberto Caprara, Matteo Fischetti, Paolo Toth: A Heuristic Algorithm for the Set Covering Problem. IPCO 1996: 72-84
- 1995
- [j1]Alberto Caprara, Matteo Fischetti, Dario Maio: Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design. IEEE Trans. Knowl. Data Eng. 7(6): 955-967 (1995)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-06 20:12 CEST by the dblp team