Diego Delle Donne

Orcid: 0000-0002-7656-5003

According to our database1, Diego Delle Donne authored at least 33 papers between 2011 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Capacitated power dominating set problem: a solution approach based on forbidden propagation sets.
CoRR, May, 2026

The 1-persistency of the clique relaxation of the stable set polytope: A focus on some forbidden structures.
Discret. Appl. Math., 2026

Freight-on-Transit operational problems with robot delivery: Genetic algorithm and Benders decomposition approaches.
Comput. Oper. Res., 2026

2025
A branch-and-price algorithm for the hyper-rectangular clustering problem with axis-parallel clusters and outliers.
Comput. Optim. Appl., March, 2025

Integrating public transport in sustainable last-mile delivery: Column generation approaches.
Eur. J. Oper. Res., 2025

The commodity constrained split delivery vehicle routing problem considering carbon emission: Formulations and a branch-and-cut method.
EURO J. Transp. Logist., 2025

Integer linear programs for the power dominating set problem with channel limitation.
Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

A first exploration of the split-interval coloring polytope.
Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

A Genetic Approach to the Operational Freight-on-Transit Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2025

2024
An incremental exact algorithm for the hyper-rectangular clustering problem with axis-parallel clusters.
CoRR, 2024

On the Complexity of the Minimum Chromatic Violation Problem.
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

1-Persistency of the Clique Relaxation of the Stable Set Polytope.
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

2023
A Novel Integer Linear Programming Approach for Global L0 Minimization.
J. Mach. Learn. Res., 2023

2022
Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques.
Ann. Oper. Res., 2022

2021
A branch-and-price algorithm for the Minimum Sum Coloring Problem.
Discret. Appl. Math., 2021

2020
The minimum chromatic violation problem: A polyhedral approach.
Discret. Appl. Math., 2020

MIP and Set Covering approaches for Sparse Approximation.
CoRR, 2020

2019
On the combinatorics of the 2-class classification problem.
Discret. Optim., 2019

2018
General cut-generating procedures for the stable set polytope.
Discret. Appl. Math., 2018

Star Routing: Between Vehicle Routing and Vertex Cover.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
The maximum-impact coloring polytope.
Int. Trans. Oper. Res., 2017

The minimum chromatic violation problem: a polyhedral study.
Electron. Notes Discret. Math., 2017

2016
Polyhedral studies of vertex coloring problems: The standard formulation.
Discret. Optim., 2016

A polyhedral study of the maximum stable set problem with weights on vertex-subsets.
Discret. Appl. Math., 2016

2015
A Strengthened General Cut-Generating Procedure for the Stable Set Polytope.
Electron. Notes Discret. Math., 2015

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

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

2013
Optimizing salmon farm cage net management using integer programming.
J. Oper. Res. Soc., 2013

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

2012
A polyhedral study of the acyclic coloring problem.
Discret. Appl. Math., 2012

Integer Programming for Optimizing Salmon Farm Cage Net Use.
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.
Electron. Notes Discret. Math., 2011

A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem.
Discret. Optim., 2011


  Loading...