Andrea Tramontani

According to our database1, Andrea Tramontani authored at least 17 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities.
INFORMS J. Comput., 2023

2021
Lattice Reformulation Cuts.
SIAM J. Optim., 2021

Multilevel Approaches for the Critical Node Problem.
Oper. Res., 2021

2020
An ILP Model for Multi-Label MRFs With Connectivity Constraints.
IEEE Trans. Image Process., 2020

Implementing Automatic Benders Decomposition in a Modern MIP Solver.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019
Solving Quadratic Programming by Cutting Planes.
SIAM J. Optim., 2019

2017
An ILP Solver for Multi-label MRFS with Connectivity Constraints.
CoRR, 2017

Cutting Planes from Wide Split Disjunctions.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
Improving branch-and-cut performance by random sampling.
Math. Program. Comput., 2016

2015
On mathematical programming with indicator constraints.
Math. Program., 2015

2014
On the Practical Strength of Two-Row Tableau Cuts.
INFORMS J. Comput., 2014

2012
A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows.
INFORMS J. Comput., 2012

2011
On the separation of disjunctive cuts.
Math. Program., 2011

Enhanced mixed integer programming techniques and routing problems.
4OR, 2011

2010
An ILP improvement procedure for the Open Vehicle Routing Problem.
Comput. Oper. Res., 2010

Experiments with Two Row Tableau Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
Enhanced Mixed Integer Programming Techniques and Routing Problems.
PhD thesis, 2009


  Loading...