Enrico Malaguti - Citegraph

Author Info

Name	Affiliation	Papers
ENRICO MALAGUTI	Department of Electronics, Computer Sciences and Systems, University of Bologna, 40136 Bologna, Italy	39
Collaborators	Citations	PageRank
53	312	21.69
Referers	Referees	References
457	483	432

Search Limit

100483

Publications (39 rows)

Collaborators (53 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Nonlinear chance-constrained problems with applications to hydro scheduling	0	0.34	2022
In Search Of Dense Subgraphs: How Good Is Greedy Peeling?	0	0.34	2021
Guest Editorial to the Feature Cluster “New Trends in Applied Combinatorial Optimization” (EURO/ALIO 2018)	0	0.34	2021
A Branch-And-Price Algorithm For The Minimum Sum Coloring Problem	0	0.34	2021
Models and algorithms for optimising two-dimensional LEGO constructions	0	0.34	2021
Discrete Programming Entailing Circulant Quadratic Forms: Refinement of a Heuristic Approach Based on ΔΣ Modulation	0	0.34	2020
On integer and bilevel formulations for the k -vertex cut problem	0	0.34	2020
Integer optimization with penalized fractional values: The Knapsack case.	2	0.38	2019
The vertex k-cut problem.	0	0.34	2019
A note on Selective line-graphs and partition colorings	0	0.34	2019
Computing k different solutions to the assignment problem	0	0.34	2019
ILP Models and Column Generation for the Minimum Sum Coloring Problem	0	0.34	2018
An exact algorithm for the Partition Coloring Problem.	3	0.39	2018
Optimizing allocation in a warehouse network	0	0.34	2018
A Branch-And-Bound Algorithm For The Knapsack Problem With Conflict Graph	3	0.42	2017
Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems.	6	0.50	2017
Training software for orthogonal packing problems.	1	0.36	2017
Design and Control of Public-Service Contracts and an Application to Public Transportation Systems.	0	0.34	2016
A metaheuristic framework for Nonlinear Capacitated Covering Problems.	0	0.34	2016
Modeling Two-Dimensional Guillotine Cutting Problems Via Integer Programming	3	0.42	2016
A branch‐and‐price algorithm for the (k,c)‐coloring problem	2	0.38	2015
Automatic Dantzig---Wolfe reformulation of mixed integer programs	7	0.61	2015
Mathematical formulations for the Balanced Vertex k-Separator Problem	1	0.35	2014
Models for the two-dimensional two-stage cutting stock problem with multiple stock size	5	0.47	2013
Test-assignment: a quadratic coloring problem	1	0.35	2013
(k, c) - coloring via Column Generation.	1	0.36	2013
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem	8	0.52	2013
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size.	7	0.49	2012
Exact weighted vertex coloring via branch-and-price.	4	0.42	2012
A Freight Service Design Problem for a Railway Corridor	4	0.45	2011
An exact approach for the Vertex Coloring Problem	40	1.24	2011
Partial convexification of general MIPs by Dantzig-Wolfe reformulation	4	0.47	2011
Algorithms for the Bin Packing Problem with Conflicts	21	0.95	2010
A Survey On Vertex Coloring Problems	80	2.49	2010
Efficient and fair routing for mesh networks	2	0.38	2010
The Vertex Coloring Problem and its generalizations	11	0.61	2009
Models and heuristic algorithms for a weighted vertex coloring problem	15	0.83	2009
An evolutionary approach for bandwidth multicoloring problems	20	0.88	2008
A Metaheuristic Approach for the Vertex Coloring Problem	61	2.23	2008