ENRICO MALAGUTI

10 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0002-5884-9360

University of Bologna

Publications

• Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation — INFORMS Journal on Computing 2026
• Adjustable Robust Optimization with Discrete Uncertainty — INFORMS Journal on Computing 2024
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem — Operations Research 2022
• Network Design with Service Requirements: Scaling-up the Size of Solvable Problems — INFORMS Journal on Computing 2022
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph — INFORMS Journal on Computing 2017
• Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming — INFORMS Journal on Computing 2016
• Design and Control of Public-Service Contracts and an Application to Public Transportation Systems — Management Science 2016
• Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem — INFORMS Journal on Computing 2013
• Algorithms for the Bin Packing Problem with Conflicts — INFORMS Journal on Computing 2010
• A Metaheuristic Approach for the Vertex Coloring Problem — INFORMS Journal on Computing 2008