Diego Delle Donne

According to our database, Diego Delle Donne authored at least 23 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

On the Complexity of the Minimum Chromatic Violation Problem.

Diego Delle Donne, Mariana S. Escalante, María Elisa Ugarte

Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

1-Persistency of the Clique Relaxation of the Stable Set Polytope.

Diego Delle Donne, Mariana S. Escalante, Pablo G. Fekete, Lucía Moroni

Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

2023

A Novel Integer Linear Programming Approach for Global L0 Minimization.

Diego Delle Donne, Matthieu Kowalski, Leo Liberti

J. Mach. Learn. Res., 2023

2022

Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques.

Fernando Aliaga, Diego Delle Donne, Guillermo Durán, Javier Marenco

Ann. Oper. Res., 2022

2021

A branch-and-price algorithm for the Minimum Sum Coloring Problem.

Diego Delle Donne, Fabio Furini, Enrico Malaguti, Roberto Wolfler Calvo

Discret. Appl. Math., 2021

2020

The minimum chromatic violation problem: A polyhedral approach.

Mónica Braga, Diego Delle Donne, Mariana S. Escalante, Javier Marenco, María Elisa Ugarte, María del Carmen Varaldo

Discret. Appl. Math., 2020

MIP and Set Covering approaches for Sparse Approximation.

Diego Delle Donne, Matthieu Kowalski, Leo Liberti

CoRR, 2020

2019

On the combinatorics of the 2-class classification problem.

Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco

Discret. Optim., 2019

2018

General cut-generating procedures for the stable set polytope.

Ricardo C. Corrêa, Diego Delle Donne, Ivo Koch, Javier Marenco

Discret. Appl. Math., 2018

Star Routing: Between Vehicle Routing and Vertex Cover.

Diego Delle Donne, Guido Tagliavini

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

The maximum-impact coloring polytope.

Mónica Braga, Diego Delle Donne, Rodrigo Linfati, Javier Marenco

Int. Trans. Oper. Res., 2017

The minimum chromatic violation problem: a polyhedral study.

Mónica Braga, Diego Delle Donne, Mariana S. Escalante, Javier Marenco, María Elisa Ugarte, María del Carmen Varaldo

Electron. Notes Discret. Math., 2017

2016

Polyhedral studies of vertex coloring problems: The standard formulation.

Diego Delle Donne, Javier Marenco

Discret. Optim., 2016

A polyhedral study of the maximum stable set problem with weights on vertex-subsets.

Manoel B. Campêlo, Victor A. Campos, Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco, Marcelo Mydlarz

Discret. Appl. Math., 2016

2015

A Strengthened General Cut-Generating Procedure for the Stable Set Polytope.

Ricardo C. Corrêa, Javier Marenco, Diego Delle Donne, Ivo Koch

Electron. Notes Discret. Math., 2015

Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation.

Victor A. Campos, Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco, Annegret Wagler

CoRR, 2015

2014

A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph.

Ricardo C. Corrêa, Philippe Michelon, Bertrand Le Cun, Thierry Mautor, Diego Delle Donne

CoRR, 2014

2013

Optimizing salmon farm cage net management using integer programming.

Francisco Cisternas, Diego Delle Donne, Guillermo Durán, Cristian Polgatiz, Andrés Weintraub

J. Oper. Res. Soc., 2013

Automatic Dwelling Segmentation of the Buenos Aires Province for the 2010 Argentinian Census.

Flavia Bonomo, Diego Delle Donne, Guillermo Durán, Javier Marenco

Interfaces, 2013

2012

A polyhedral study of the acyclic coloring problem.

Mónica Braga, Diego Delle Donne, Javier Marenco

Discret. Appl. Math., 2012

Integer Programming for Optimizing Salmon Farm Cage Net Use.

Francisco Cisternas, Diego Delle Donne, Guillermo Durán, Cristian Polgatiz, Andrés Weintraub

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Solving the segmentation problem for the 2010 Argentine census with integer programming.

Diego Delle Donne, Guillermo Durán, Javier Marenco

Electron. Notes Discret. Math., 2011

A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem.

Diego Delle Donne, Javier Marenco

Discret. Optim., 2011