Diego Delle Donne

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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...