Andrea Tramontani

Available identifiers

Publication	Date of Publication	Type
Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities	2024-02-27	Paper
Implementing Automatic Benders Decomposition in a Modern MIP Solver	2022-10-14	Paper
An ILP Model for Multi-Label MRFs With Connectivity Constraints	2022-09-16	Paper
Lattice Reformulation Cuts	2021-11-05	Paper
Multilevel Approaches for the Critical Node Problem	2021-06-17	Paper
Solving Quadratic Programming by Cutting Planes	2019-05-07	Paper
Cutting planes from wide split disjunctions	2017-08-31	Paper
On the Practical Strength of Two-Row Tableau Cuts	2017-02-17	Paper
A time bucket formulation for the traveling salesman problem with time windows	2016-06-29	Paper
Improving branch-and-cut performance by random sampling	2016-04-13	Paper
On mathematical programming with indicator constraints	2015-06-19	Paper
Enhanced mixed integer programming techniques and routing problems	2012-01-10	Paper
On the separation of disjunctive cuts	2011-06-17	Paper
An ILP improvement procedure for the open vehicle routing problem	2010-09-07	Paper
Experiments with Two Row Tableau Cuts	2010-06-22	Paper
An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems	2010-06-02	Paper
Improving on branch-and-cut algorithms for generalized minimum spanning trees	2006-02-08	Paper

This page was built for person: Andrea Tramontani