An evolutionary approach for bandwidth multicoloring problems. - Enrico Malaguti; Paolo Toth (Eur. J. Oper. Res., 2008)

A Metaheuristic Approach for the Vertex Coloring Problem. - Enrico Malaguti; Michele Monaci; Paolo Toth (INFORMS J. Comput., 2008)

The Vertex Coloring Problem and its generalizations. - Enrico Malaguti (4OR, 2009)

Models and heuristic algorithms for a weighted vertex coloring problem. - Enrico Malaguti; Michele Monaci; Paolo Toth (J. Heuristics, 2009)

Algorithms for the Bin Packing Problem with Conflicts. - Albert Einstein Fernandes Muritiba; Manuel Iori; Enrico Malaguti; Paolo Toth (INFORMS J. Comput., 2010)

A survey on vertex coloring problems. - Enrico Malaguti; Paolo Toth (Int. Trans. Oper. Res., 2010)

Efficient and fair routing for mesh networks. - Andrea Lodi 001; Enrico Malaguti; Nicolás E. Stier Moses (Math. Program., 2010)

Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. - Martin Bergner; Alberto Caprara; Fabio Furini; Marco E. Lübbecke; Enrico Malaguti; Emiliano Traversi (IPCO, 2011)

An exact approach for the Vertex Coloring Problem. - Enrico Malaguti; Michele Monaci; Paolo Toth (Discret. Optim., 2011)

A Freight Service Design Problem for a Railway Corridor. - Alberto Caprara; Enrico Malaguti; Paolo Toth (Transp. Sci., 2011)

Exact weighted vertex coloring via branch-and-price. - Fabio Furini; Enrico Malaguti (Discret. Optim., 2012)

A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. - Fabio Furini; Enrico Malaguti; Rosa Medina Durán; Alfredo Persiani; Paolo Toth (Eur. J. Oper. Res., 2012)

Models for the two-dimensional two-stage cutting stock problem with multiple stock size. - Fabio Furini; Enrico Malaguti (Comput. Oper. Res., 2013)

(k, c) - coloring via Column Generation. - Enrico Malaguti; Isabel Méndez-Díaz; Juan José Miranda Bront; Paula Zabala (Electron. Notes Discret. Math., 2013)

Test-assignment: a quadratic coloring problem. - Jelle Duives; Andrea Lodi 001; Enrico Malaguti (J. Heuristics, 2013)

Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem. - Alberto Caprara; Fabio Furini; Enrico Malaguti (INFORMS J. Comput., 2013)

Mathematical formulations for the Balanced Vertex k-Separator Problem. - Denis Cornaz; Fabio Furini; Mathieu Lacroix 001; Enrico Malaguti; Ali Ridha Mahjoub; Sébastien Martin (CoDIT, 2014)

Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems. - Denis Cornaz; Fabio Furini; Enrico Malaguti (CTW, 2015)

Automatic Dantzig-Wolfe reformulation of mixed integer programs. - Martin Bergner; Alberto Caprara; Alberto Ceselli; Fabio Furini; Marco E. Lübbecke; Enrico Malaguti; Emiliano Traversi (Math. Program., 2015)

A branch-and-price algorithm for the (k, c)-coloring problem. - Enrico Malaguti; Isabel Méndez-Díaz; Juan José Miranda Bront; Paula Zabala (Networks, 2015)

Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming. - Fabio Furini; Enrico Malaguti; Dimitri Thomopulos (INFORMS J. Comput., 2016)

Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation. - Alberto Caprara; Fabio Furini; Enrico Malaguti; Emiliano Traversi (Inf. Process. Lett., 2016)

Design and Control of Public-Service Contracts and an Application to Public Transportation Systems. - Andrea Lodi 001; Enrico Malaguti; Nicolás E. Stier Moses; Tommaso Bonino (Manag. Sci., 2016)

A metaheuristic framework for Nonlinear Capacitated Covering Problems. - Enrico Malaguti; Rosa Medina Durán; Paolo Toth (Optim. Lett., 2016)

Training software for orthogonal packing problems. - Gianluca Costa; Maxence Delorme; Manuel Iori; Enrico Malaguti; Silvano Martello (Comput. Ind. Eng., 2017)

Solving vertex coloring problems as maximum weight stable set problems. - Denis Cornaz; Fabio Furini; Enrico Malaguti (Discret. Appl. Math., 2017)

A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph. - Andrea Bettinelli; Valentina Cacchiani; Enrico Malaguti (INFORMS J. Comput., 2017)

An exact algorithm for the Partition Coloring Problem. - Fabio Furini; Enrico Malaguti; Alberto Santini (Comput. Oper. Res., 2018)

Preface. - Valentina Cacchiani; Enrico Malaguti; Antonio Mauttone; Paolo Toth (Electron. Notes Discret. Math., 2018)

ILP Models and Column Generation for the Minimum Sum Coloring Problem. - Fabio Furini; Enrico Malaguti; Sébastien Martin; Ian-Christopher Ternier (Electron. Notes Discret. Math., 2018)

Optimizing allocation in a warehouse network. - Enrico Malaguti; Giacomo Nannicini; Dimitri Thomopulos (Electron. Notes Discret. Math., 2018)

Computing k different solutions to the assignment problem. - Enrico Malaguti; Rosa Medina Durán (Comput. Ind. Eng., 2019)

The vertex k-cut problem. - Denis Cornaz; Fabio Furini; Mathieu Lacroix 001; Enrico Malaguti; Ali Ridha Mahjoub; Sébastien Martin (Discret. Optim., 2019)

Integer optimization with penalized fractional values: The Knapsack case. - Enrico Malaguti; Michele Monaci; Paolo Paronuzzi; Ulrich Pferschy (Eur. J. Oper. Res., 2019)

A note on selective line-graphs and partition colorings. - Denis Cornaz; Fabio Furini; Enrico Malaguti; Alberto Santini (Oper. Res. Lett., 2019)

On integer and bilevel formulations for the k-vertex cut problem. - Fabio Furini; Ivana Ljubic; Enrico Malaguti; Paolo Paronuzzi (Math. Program. Comput., 2020)

Discrete Programming Entailing Circulant Quadratic Forms: Refinement of a Heuristic Approach Based on ΔΣ Modulation. - Sergio Callegari; Federico Bizzarri; Enrico Malaguti (IEEE Trans. Circuits Syst. II Express Briefs, 2020)

A new formulation for the Weighted Safe Set Problem. - Enrico Malaguti; Vagner Pedrotti (LAGOS, 2021)

Models and algorithms for integrated production and distribution problems. - Vincenzo Bo; Marco Bortolini; Enrico Malaguti; Michele Monaci; Cristina Mora; Paolo Paronuzzi (Comput. Ind. Eng., 2021)

A branch-and-price algorithm for the Minimum Sum Coloring Problem. - Diego Delle Donne; Fabio Furini; Enrico Malaguti; Roberto Wolfler Calvo (Discret. Appl. Math., 2021)

Guest Editorial to the Feature Cluster "New Trends in Applied Combinatorial Optimization" (EURO/ALIO 2018). - Valentina Cacchiani; Enrico Malaguti; Paolo Toth (Eur. J. Oper. Res., 2021)

Models and algorithms for optimising two-dimensional LEGO constructions. - Torkil Kollsker; Enrico Malaguti (Eur. J. Oper. Res., 2021)

In search of dense subgraphs: How good is greedy peeling? - Naga Venkata C. Gudapati; Enrico Malaguti; Michele Monaci (Networks, 2021)

Network Design with Service Requirements: Scaling-up the Size of Solvable Problems. - Naga Venkata C. Gudapati; Enrico Malaguti; Michele Monaci (INFORMS J. Comput., 2022)

Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem. - Fabio Furini; Ivana Ljubic; Enrico Malaguti; Paolo Paronuzzi (Oper. Res., 2022)

Nonlinear chance-constrained problems with applications to hydro scheduling. - Andrea Lodi 001; Enrico Malaguti; Giacomo Nannicini; Dimitri Thomopulos (Math. Program., 2022)

K-adaptability in stochastic optimization. - Enrico Malaguti; Michele Monaci; Jonas Pruente (Math. Program., 2022)

Scheduling of semi-automatic carousels with fixed production sequences. - Giampaolo Campana; Enrico Malaguti; Mattia Mele; Paolo Paronuzzi (Int. J. Prod. Res., 2023)

A decision support system for scheduling a vaccination campaign during a pandemic emergency: The COVID-19 case. - Cristiano Fabbri; Pierfrancesco Ghedini; Marco Leonessi; Enrico Malaguti; Paolo Tubertini (Comput. Ind. Eng., 2023)

Models and algorithms for the Weighted Safe Set Problem. - Enrico Malaguti; Vagner Pedrotti (Discret. Appl. Math., 2023)

Corrigendum to: 'Integer optimization with penalized fractional values: The Knapsack case' [European Journal of Operational Research (2019) 874-888]. - Enrico Malaguti; Michele Monaci; Paolo Paronuzzi; Ulrich Pferschy (Eur. J. Oper. Res., 2023)

An iterated local search matheuristic approach for the multi-vehicle inventory routing problem. - Demetrio Laganà; Enrico Malaguti; Michele Monaci; Roberto Musmanno; Paolo Paronuzzi (Comput. Oper. Res., 2024)

Adjustable Robust Optimization with Discrete Uncertainty. - Henri Lefebvre; Enrico Malaguti; Michele Monaci (INFORMS J. Comput., 2024)

Adjustable robust optimization with objective uncertainty. - Boris Detienne; Henri Lefebvre; Enrico Malaguti; Michele Monaci (Eur. J. Oper. Res., 2024)

The min-Knapsack problem with compactness constraints and applications in statistics. - Alberto Santini; Enrico Malaguti (Eur. J. Oper. Res., 2024)

A solution algorithm for chance-constrained problems with integer second-stage recourse decisions. - Andrea Lodi 001; Enrico Malaguti; Michele Monaci; Giacomo Nannicini; Paolo Paronuzzi (Math. Program., 2024)

A computational study on Integer Programming formulations for Hop-constrained survivable network design. - Naga Venkata C. Gudapati; Enrico Malaguti; Michele Monaci; Paolo Paronuzzi (Discret. Appl. Math., 2025)

Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation. - Mathijs Barkel; Maxence Delorme; Enrico Malaguti; Michele Monaci (Eur. J. Oper. Res., 2025)