Abstract
This is a summary of the author’s PhD thesis supervised by Paolo Toth and defended on 29 May 2007 at the Università di Bologna. The thesis is written in English and is available from the author upon request. The first part of this work deals with the Vertex Coloring Problem and its generalizations, for which models, bounds and algorithms are proposed. The Second Part is dedicated to a different problem on graphs, namely a Routing Problem in telecommunication networks where not only the efficiency, but also the fairness of the solution is considered.
Similar content being viewed by others
References
Aardal KI, van Hoesel CPM, Koster AMCA, Mannino C, Sassano A (2001) Models and solution techniques for the frequency assignment problem. ZIB-report 01–40, Berlin
Fernandes Muritiba AE, Iori M, Malaguti E, Toth P (2006) Lower and upper bounds for the bin packing problem with conflicts. Technical Report OR/06/7, DEIS, University of Bologna
Finke G, Jost V, Queyranne M, Sebö A (2004) Batch processing with interval graph compatibilities between tasks. Cahiers du laboratoire Leibniz, 108
Gendreau M, Laporte G and Semet F (2004). Heuristics and lower bounds for the bin packing problem with conflicts. Comput Oper Res 31: 347–358
Lodi A, Malaguti E, Stier Moses N (2008) Efficient and fair routing for ad hoc wireless telecommunication networks. Technical Report OR/08/1, DEIS, University of Bologna
Malaguti E, Toth P (2007) An evolutionary approach for bandwidth multicoloring problems. Eur J Oper Res. doi:10.1016/j.ejor.2006.09.095
Malaguti E, Monaci M, Toth P (2006) A set-covering based approach for a weighted vertex coloring problem. Technical Report OR/06/4, DEIS, University of Bologna
Malaguti E, Monaci M, Toth P (2008) A metaheuristic approach for the vertex coloring problem. INFORMS J Comput. doi:10.1287/ijoc.1070.0245
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Malaguti, E. The Vertex Coloring Problem and its generalizations. 4OR-Q J Oper Res 7, 101–104 (2009). https://doi.org/10.1007/s10288-008-0071-y
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-008-0071-y