Diego Delle Donne
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Diego Delle Donne has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Javier Marenco
Escuela de Negocios, Universidad Torcuato Di Tella, Buenos Aires, Argentina
8 shared publications - Claudia Archetti
University of Brescia
3 shared publications - Laurent Alfandari
ESSEC Business School
3 shared publications - Ricardo Cordeiro Correa
Departamento de Computação Campus do Pici Universidade Federal do Ceará Bloco 910 60440-554 Fortaleza -CE Brazil
3 shared publications - Corentin Juvigny
ESSEC Business School
2 shared publications - Guillermo Durán
Instituto de Cálculo and Departamento de Matemática, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina
2 shared publications
Latest Publications
- Open Access
- 20 July 2026
- Published by Elsevier in European Journal of Operational Research
A branch-and-price approach for last-mile deliveries with capacitated robot stations
- 20 July 2026
- Published by Elsevier in European Journal of Operational Research
Open AccessA branch-and-price approach for last-mile deliveries with capacitated robot stations
- Open Access
- 5 May 2026
- Published by Elsevier in SSRN Electronic Journal
The Minimum Chromatic Violation Problem: Complexity on Some Graph Classes
We consider a generalization of the classical vertex coloring problem on graphs (VCP), in which the edge set of the graph is partitioned into strong and weak edges. Given a number 𝑘 of available colors, the minimum chromatic violation problem (MCVP) asks for a vertex coloring such that no strong edge has its endpoints assigned to the same color; while minimizing the number of weak edges whose endpoints share the same color. In this work, we focus on the computational complexity of MCVP over several graph families such as interval and unit-interval graphs, among others. We show that MCVPisNP-hard even if the graph obtained by removing the weak edges is unit interval, trivially perfect or distance hereditary. On the other hand, we provide a polynomial-time algorithm that solves MCVP when the graph is a unit-interval graph without triangles with two or more weak edges. Furthermore, we provide an algorithm to solve MCVPon a graph 𝐺 when the set of weak edges 𝐹 includes only cut edges of 𝐺, and we show that in these cases, the algorithm finds an optimal solution in which no weak edge is violated or proves that the problem is infeasible. We show that the provided algorithm runs in polynomial time, whenever VCPcan be solved in polynomial time in the graph 𝐺 −𝐹, i.e., the graph obtained by removing the weak edges. Finally, we provide a polyhedral characterization of the chromatic violation polytope for block graphs when weak edges are cut edges, giving a theoretical counterpart to our algorithmic findings.
- 5 May 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessThe Minimum Chromatic Violation Problem: Complexity on Some Graph Classes
We consider a generalization of the classical vertex coloring problem on graphs (VCP), in which the edge set of the graph is partitioned into strong and weak edges. Given a number 𝑘 of available colors, the minimum chromatic violation problem (MCVP) asks for a vertex coloring such that no strong edge has its endpoints assigned to the same color; while minimizing the number of weak edges whose endpoints share the same color. In this work, we focus on the computational complexity of MCVP over several graph families such as interval and unit-interval graphs, among others. We show that MCVPisNP-hard even if the graph obtained by removing the weak edges is unit interval, trivially perfect or distance hereditary. On the other hand, we provide a polynomial-time algorithm that solves MCVP when the graph is a unit-interval graph without triangles with two or more weak edges. Furthermore, we provide an algorithm to solve MCVPon a graph 𝐺 when the set of weak edges 𝐹 includes only cut edges of 𝐺, and we show that in these cases, the algorithm finds an optimal solution in which no weak edge is violated or proves that the problem is infeasible. We show that the provided algorithm runs in polynomial time, whenever VCPcan be solved in polynomial time in the graph 𝐺 −𝐹, i.e., the graph obtained by removing the weak edges. Finally, we provide a polyhedral characterization of the chromatic violation polytope for block graphs when weak edges are cut edges, giving a theoretical counterpart to our algorithmic findings.
- Open Access
- 21 April 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 193
Freight-on-Transit operational problems with robot delivery: Genetic algorithm and Benders decomposition approaches
- 21 April 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 193
Open AccessFreight-on-Transit operational problems with robot delivery: Genetic algorithm and Benders decomposition approaches
- Open Access
- 2 March 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 387, 37-56
The 1-persistency of the clique relaxation of the stable set polytope: A focus on some forbidden structures
- 2 March 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 387, 37-56
Open AccessThe 1-persistency of the clique relaxation of the stable set polytope: A focus on some forbidden structures
- 20 June 2025
- Published by Springer Nature
- p. 15-24
On the Hardness of Edge Coloring Problems Associated with Scheduling
- 20 June 2025
- Published by Springer Nature
- p. 15-24
On the Hardness of Edge Coloring Problems Associated with Scheduling
- 18 March 2025
- Published by Springer Nature
- p. 116-132
A Genetic Approach to the Operational Freight-on-Transit Problem
- 18 March 2025
- Published by Springer Nature
- p. 116-132
A Genetic Approach to the Operational Freight-on-Transit Problem
- Open Access
- 21 February 2025
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 14
The commodity constrained split delivery vehicle routing problem considering carbon emission: Formulations and a branch-and-cut method
- 21 February 2025
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 14
Open AccessThe commodity constrained split delivery vehicle routing problem considering carbon emission: Formulations and a branch-and-cut method
- Open Access
- 24 January 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 324 (1) , 75-91
Integrating public transport in sustainable last-mile delivery: Column generation approaches
- 24 January 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 324 (1) , 75-91
Open AccessIntegrating public transport in sustainable last-mile delivery: Column generation approaches
- 18 December 2024
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 90 (2) , 583-605
A branch-and-price algorithm for the hyper-rectangular clustering problem with axis-parallel clusters and outliers
- 18 December 2024
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 90 (2) , 583-605
A branch-and-price algorithm for the hyper-rectangular clustering problem with axis-parallel clusters and outliers
- 22 May 2024
- Published by Springer Nature
- p. 71-84
1-Persistency of the Clique Relaxation of the Stable Set Polytope
- 22 May 2024
- Published by Springer Nature
- p. 71-84
1-Persistency of the Clique Relaxation of the Stable Set Polytope