Caprara Alberto

Alberto Caprara

Information about the author Alberto Caprara will soon be added to the site.
Found 33 papers in total
Theoretical and computational results about optimality-based domain reductions
Theoretical and computational results about optimality-based domain reductions
2016
In this paper we discuss optimality‐based domain reductions for Global...
Timetabling and assignment problems in railway planning and integer multicommodity flow
Timetabling and assignment problems in railway planning and integer multicommodity flow
2015
We reconsider the successful approaches that we adopted in the past to solve Train...
Uncommon Dantzig‐Wolfe Reformulation for the Temporal Knapsack Problem
Uncommon Dantzig‐Wolfe Reformulation for the Temporal Knapsack Problem
2013
We study a natural generalization of the knapsack problem, in which each item exists...
Finding cliques of maximum weight on a generalization of permutation graphs
Finding cliques of maximum weight on a generalization of permutation graphs
2013
We propose a dynamic programming procedure for computing the clique of maximum weight...
On integer polytopes with few nonzero vertices
On integer polytopes with few nonzero vertices
2013
We provide a simple description in terms of linear inequalities of the convex hull of...
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling
2012
Finding robust yet efficient solutions to optimization problems is a major practical...
A Freight Service Design Problem for a Railway Corridor
A Freight Service Design Problem for a Railway Corridor
2011
We study the problem of designing a set of highly profitable freight routes in a...
Solution of the Train Platforming Problem
Solution of the Train Platforming Problem
2011
In this paper we study a general formulation of the train platforming problem, which...
Decorous Lower Bounds for Minimum Linear Arrangement
Decorous Lower Bounds for Minimum Linear Arrangement
2011
Minimum linear arrangement is a classical basic combinatorial optimization problem...
Scheduling extra freight trains on railway networks
Scheduling extra freight trains on railway networks
2010
We study the problem of freight transportation in railway networks, where both...
Packing d-Dimensional Bins in d Stages
Packing d-Dimensional Bins in d Stages
2008
We consider the d –dimensional bin–packing problem, the most relevant...
Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
2007
Embedding cuts into a branch–and–cut framework is a delicate task,...
Packing into the smallest square: Worst-case analysis of lower bounds
Packing into the smallest square: Worst-case analysis of lower bounds
2006
We address the problem of packing a given set of rectangles into the minimum size...
Laying out sparse graphs with provably minimum bandwidth
Laying out sparse graphs with provably minimum bandwidth
2005
Finding a linear layout of a graph having minimum bandwidth is a combinatorial...
Fast approximation schemes for two-stage, two-dimensional bin packing
Fast approximation schemes for two-stage, two-dimensional bin packing
2005
We present an asymptotic fully polynomial time approximation scheme for the...
On the two-dimensional Knapsack problem
On the two-dimensional Knapsack problem
2004
We address the two-dimensional Knapsack Problem (2KP), aimed at packing a...
Worst-case analysis of the subset sum algorithm for bin packing
Worst-case analysis of the subset sum algorithm for bin packing
2004
We analyze the worst-case ratio of a natural heuristic for the bin packing problem,...
A ¾-approximation algorithm for multiple subset sum
A ¾-approximation algorithm for multiple subset sum
2003
The Multiple Subset Sum Problem is the variant of bin packing in which the number of...
The reversal median problem
The reversal median problem
2003
In this paper, we study the Reversal Median Problem (RMP), which arises in...
Approximation schemes for ordered vector packing problems
Approximation schemes for ordered vector packing problems
2003
In this paper we deal with the d -dimensional vector packing problem, which is a...
Sorting permutations by reversals through branch-and-price
Sorting permutations by reversals through branch-and-price
2001
We describe an exact algorithm for the problem of sorting a permutation by the minimum...
Modeling and solving the train timetabling problem
Modeling and solving the train timetabling problem
2002
The train timetabling problem aims at determining a periodic timetable for a set of...
Sorting permutations by reversals through branch-and-price
Sorting permutations by reversals through branch-and-price
2001
We describe an exact algorithm for the problem of sorting a permutation by the minimum...
Algorithms for the set covering problem
Algorithms for the set covering problem
2000
The Set Covering Problem (SCP) is a main model for several important applications,...
Papers per page: