Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Diego Delle Donne"'
Publikováno v:
Annals of Operations Research. 316:891-904
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b4f13d22192b498ce2210f9fc859f66
https://doi.org/10.1007/s10479-022-04620-8
https://doi.org/10.1007/s10479-022-04620-8
We study a delivery strategy for last-mile deliveries in urban areas which combines freight transportation with mass mobility systems with the goal of creating synergies contrasting negative externalities caused by transportation. The idea is to use
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ef64b26f981a14060fe6d8cc6ae8155
https://hdl.handle.net/11379/569985
https://hdl.handle.net/11379/569985
Autor:
María del Carmen Varaldo, Maria E. Ugarte, Mónica Braga, Mariana S. Escalante, Javier Marenco, Diego Delle Donne
Publikováno v:
Discrete Applied Mathematics. 281:69-80
In this paper we define a generalization of the classical vertex coloring problem of a graph, where some pairs of adjacent vertices can be assigned to the same color. We call weak an edge connecting two such vertices. We look for a coloring of the gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffda1488a726158729e879e27a4953b9
https://doi.org/10.1016/j.dam.2019.05.010
https://doi.org/10.1016/j.dam.2019.05.010
Publikováno v:
Waste Management & Research: The Journal for a Sustainable Circular Economy. 39:209-220
A solution strategy based on integer linear programming models has been developed for leaf sweeping operations in the Argentine city of Trenque Lauquen. The aim is to achieve efficiency in the assignment of sweepers to city blocks, the identification
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b3ef7999255f08f21c706795d426aac
https://doi.org/10.1177/0734242x20922597
https://doi.org/10.1177/0734242x20922597
Publikováno v:
Discrete applied mathematics (2020). doi:10.1016/j.dam.2020.08.031
info:cnr-pdr/source/autori:Delle Donne D.; Furini F.; Malaguti E.; Wolfler Calvo R./titolo:A branch-and-price algorithm for the Minimum Sum Coloring Problem/doi:10.1016%2Fj.dam.2020.08.031/rivista:Discrete applied mathematics/anno:2020/pagina_da:/pagina_a:/intervallo_pagine:/volume
info:cnr-pdr/source/autori:Delle Donne D.; Furini F.; Malaguti E.; Wolfler Calvo R./titolo:A branch-and-price algorithm for the Minimum Sum Coloring Problem/doi:10.1016%2Fj.dam.2020.08.031/rivista:Discrete applied mathematics/anno:2020/pagina_da:/pagina_a:/intervallo_pagine:/volume
A proper coloring of a given graph is an assignment of a positive integer number (color) to each vertex such that two adjacent vertices receive different colors. This paper studies the Minimum Sum Coloring Problem (MSCP), which asks for finding a pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e68a86a4e364c3879d837a185b1dad97
http://hdl.handle.net/11573/1571754
http://hdl.handle.net/11573/1571754
Publikováno v:
Discrete Applied Mathematics. 245:28-41
We propose general separation procedures for generating cuts for the stable set polytope, inspired by a procedure by Rossi and Smriglio and applying a lifting method by Xavier and Campelo. In contrast to existing cut-generating procedures, ours gener
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72a083fa2747e3070ef149f1e58dc97a
https://doi.org/10.1016/j.dam.2017.02.005
https://doi.org/10.1016/j.dam.2017.02.005
Autor:
Mónica Braga, María del Carmen Varaldo, Diego Delle Donne, Mariana S. Escalante, Javier Marenco, Maria E. Ugarte
Publikováno v:
Electronic Notes in Discrete Mathematics. 62:309-314
We propose a generalization of the k-coloring problem, namely the minimum chromatic violation problem (MCVP). Given a graph G = ( V , E ) , a set of weak edges F ⊂ E and a set of colors C , the MCVP asks for a | C | -coloring of the graph G ′ = (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e53c715d5966caabcb63e94ff1cac3b
https://doi.org/10.1016/j.endm.2017.10.053
https://doi.org/10.1016/j.endm.2017.10.053
Autor:
Diego Delle Donne, Javier Marenco
Publikováno v:
Discrete Optimization. 21:1-13
Despite the fact that many vertex coloring problems are polynomially solvable on certain graph classes, most of these problems are not "under control" from a polyhedral point of view. The equivalence between optimization and separation suggests the e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c36b7375e3daf15879b85f0f1a38bea6
https://doi.org/10.1016/j.disopt.2016.05.001
https://doi.org/10.1016/j.disopt.2016.05.001
Publikováno v:
International Transactions in Operational Research. 24:303-324
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ac81e219adbf6b951c42c65460c937c
https://doi.org/10.1111/itor.12265
https://doi.org/10.1111/itor.12265
Publikováno v:
Electronic Notes in Discrete Mathematics. 50:261-266
In a previous work we have presented a procedure for generating rank and non-rank valid inequalities for the stable set polytope based on clique projection and lifting operations. In this work we propose to apply another lifting operation and give so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::810949903312a8ad151c5dc6cebfaa7b
https://doi.org/10.1016/j.endm.2015.07.044
https://doi.org/10.1016/j.endm.2015.07.044