Marco Di Summa

Math. Oper. Res., 2024

2023

Critical node/edge detection problems on trees.

[BibT_eX]

[DOI]

Syed Md Omar Faruk

4OR, September, 2023

Complexity of branch-and-bound and cutting planes in mixed-integer optimization.

[BibT_eX]

[DOI]

Math. Program., March, 2023

2021

Split Cuts in the Plane.

[BibT_eX]

[DOI]

SIAM J. Optim., 2021

Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective.

[BibT_eX]

[DOI]

4OR, 2021

Towards Lower Bounds on the Depth of ReLU Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2021

2020

Piecewise smooth extreme functions are piecewise linear.

[BibT_eX]

[DOI]

Math. Program., 2020

Balas formulation for the union of polytopes is optimal.

[BibT_eX]

[DOI]

Yuri Faenza

Math. Program., 2020

An extreme function which is nonnegative and discontinuous everywhere.

[BibT_eX]

[DOI]

Amitabh Basu

Math. Program., 2020

Complexity of cutting planes and branch-and-bound in mixed-integer optimization.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Optimal Cutting Planes from the Group Relaxations.

[BibT_eX]

[DOI]

Math. Oper. Res., 2019

2017

The Structure of the Infinite Models in Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

Maximal S-Free Convex Sets and the Helly Number.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Extreme Functions with an Arbitrary Number of Slopes.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015

A short convex-hull proof for the all-different system with the inclusion property.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

A geometric approach to cut-generating functions.

[BibT_eX]

[DOI]

Amitabh Basu

Math. Program., 2015

A branch-price-and-cut algorithm for the minimum evolution problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

Finding the closest ultrametric.

[BibT_eX]

[DOI]

David Pritchard

Laura Sanità

Discret. Appl. Math., 2015

On largest volume simplices and sub-determinants.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Reverse Split Rank.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

On the Convergence of the Affine Hull of the Chvátal-Gomory Closures.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth.

[BibT_eX]

[DOI]

Bernardetta Addis

Andrea Grosso

Discret. Appl. Math., 2013

Reverse Chvátal-Gomory Rank.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

Branch and cut algorithms for detecting critical nodes in undirected graphs.

[BibT_eX]

[DOI]

Andrea Grosso

Marco Locatelli

Comput. Optim. Appl., 2012

On sub-determinants and the diameter of polyhedra.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Mixing Sets Linked by Bidirected Paths.

[BibT_eX]

[DOI]

SIAM J. Optim., 2011

Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Complexity of the critical node problem over trees.

[BibT_eX]

[DOI]

Andrea Grosso

Marco Locatelli

Comput. Oper. Res., 2011

Optimal solutions for the balanced minimum evolution problem.

[BibT_eX]

[DOI]

Roberto Aringhieri

Daniele Catanzaro

Comput. Oper. Res., 2011

2010

Lot-Sizing with Stock Upper Bounds and Fixed Charges.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

On a class of mixed-integer sets with a single integer variable.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

2009

Network Formulations of Mixed-Integer Programs.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

2008

Lot-sizing on a tree.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

The Mixing Set with Divisible Capacities.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007

The Mixing Set with Flows.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Minimally Infeasible Set-Partitioning Problems with Balanced Constraints.

[BibT_eX]

[DOI]

Giacomo Zambelli

Math. Oper. Res., 2007

The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows.

[BibT_eX]

[DOI]