# Andrea Tramontani

• Math. Program.
• 2011
Disjunctive cuts for Mixed-Integer Linear Programs have been introduced by Egon Balas in the late 70’s, and successfully exploited in practice since the late 90’s. In this paper we investigate the main ingredients of a disjunctive cut separation procedure, and analyze their impact on the quality of the root-node bound for a set of instances taken from(More)
• Math. Program.
• 2015
In this paper we review the relevant literature on mathematical optimization with logical implications, i.e., where constraints can be either active or disabled depending on logical conditions to hold. In the case of convex functions, the theory of disjunctive programming allows one to formulate these logical implications as convex nonlinear programming(More)
• 3
• 6
• INFORMS Journal on Computing
• 2014
Following the flurry of recent theoretical work on cutting planes from two-row mixed integer group relaxations of an LP tableau, we report on computational tests to evaluate the strength of two-row cuts based on lattice-free triangles having more than one integer point on one side. A heuristic procedure to generate such triangles (referred to in the(More)
• Computers & OR
• 2010
We address the Open Vehicle Routing Problem (OVRP), a variant of the ‘‘classical’’ (capacitated and distance constrained) Vehicle Routing Problem (VRP) in which the vehicles are not required to return to the depot after completing their service. We present a heuristic improvement procedure for OVRP based on Integer Linear Programming (ILP) techniques. Given(More)
where x ∈ R is the vector of decision variables, c ∈ R is a linear objective function and S ⊂ R is the set of feasible solutions of (1). Because S is generally hard to deal with, a possible approach for tackling (1) is to optimize the objective function over a suitable relaxation (i.e., easy to solve) P ⊇ S. Let x be the optimal solution over P . If x ∈ S(More)
• Math. Program. Comput.
• 2016
We discuss the variability in the performance of multiple runs of branchand-cut mixed integer linear programming solvers, and we concentrate on the one deriving from the use of different optimal bases of the linear programming relaxations. We propose a new algorithm exploiting more than one of those bases and we show that different versions of the(More)
The Traveling Salesman Problem with Time Windows (TSPTW) is the problem of finding a minimum-cost path visiting a set of cities exactly once, where each city must be visited within a given time window. We present an extended formulation for the problem based on partitioning the time windows into sub-windows, which we call buckets. We present cutting planes(More)