Enrico Malaguti

Orcid: 0000-0002-5884-9360

According to our database1, Enrico Malaguti authored at least 54 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions.
Math. Program., May, 2024

The min-Knapsack problem with compactness constraints and applications in statistics.
Eur. J. Oper. Res., January, 2024

Adjustable robust optimization with objective uncertainty.
Eur. J. Oper. Res., January, 2024

2023
Corrigendum to: 'Integer optimization with penalized fractional values: The Knapsack case' [European Journal of Operational Research (2019) 874-888].
Eur. J. Oper. Res., June, 2023

Models and algorithms for the Weighted Safe Set Problem.
Discret. Appl. Math., April, 2023

A decision support system for scheduling a vaccination campaign during a pandemic emergency: The COVID-19 case.
Comput. Ind. Eng., March, 2023

Scheduling of semi-automatic carousels with fixed production sequences.
Int. J. Prod. Res., February, 2023

2022
K-adaptability in stochastic optimization.
Math. Program., 2022

Nonlinear chance-constrained problems with applications to hydro scheduling.
Math. Program., 2022

Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem.
Oper. Res., 2022

Network Design with Service Requirements: Scaling-up the Size of Solvable Problems.
INFORMS J. Comput., 2022

2021
In search of dense subgraphs: How good is greedy peeling?
Networks, 2021

Models and algorithms for optimising two-dimensional LEGO constructions.
Eur. J. Oper. Res., 2021

Guest Editorial to the Feature Cluster "New Trends in Applied Combinatorial Optimization" (EURO/ALIO 2018).
Eur. J. Oper. Res., 2021

A branch-and-price algorithm for the Minimum Sum Coloring Problem.
Discret. Appl. Math., 2021

Models and algorithms for integrated production and distribution problems.
Comput. Ind. Eng., 2021

A new formulation for the Weighted Safe Set Problem.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020
Discrete Programming Entailing Circulant Quadratic Forms: Refinement of a Heuristic Approach Based on ΔΣ Modulation.
IEEE Trans. Circuits Syst. II Express Briefs, 2020

On integer and bilevel formulations for the <i>k</i>-vertex cut problem.
Math. Program. Comput., 2020

2019
A note on selective line-graphs and partition colorings.
Oper. Res. Lett., 2019

Integer optimization with penalized fractional values: The Knapsack case.
Eur. J. Oper. Res., 2019

The vertex k-cut problem.
Discret. Optim., 2019

Computing <i>k</i> different solutions to the assignment problem.
Comput. Ind. Eng., 2019

2018
Optimizing allocation in a warehouse network.
Electron. Notes Discret. Math., 2018

ILP Models and Column Generation for the Minimum Sum Coloring Problem.
Electron. Notes Discret. Math., 2018

Preface.
Electron. Notes Discret. Math., 2018

An exact algorithm for the Partition Coloring Problem.
Comput. Oper. Res., 2018

2017
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph.
INFORMS J. Comput., 2017

Solving vertex coloring problems as maximum weight stable set problems.
Discret. Appl. Math., 2017

Training software for orthogonal packing problems.
Comput. Ind. Eng., 2017

2016
A metaheuristic framework for Nonlinear Capacitated Covering Problems.
Optim. Lett., 2016

Design and Control of Public-Service Contracts and an Application to Public Transportation Systems.
Manag. Sci., 2016

Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation.
Inf. Process. Lett., 2016

Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming.
INFORMS J. Comput., 2016

2015
A branch-and-price algorithm for the (<i>k, c</i>)-coloring problem.
Networks, 2015

Automatic Dantzig-Wolfe reformulation of mixed integer programs.
Math. Program., 2015

Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Mathematical formulations for the Balanced Vertex k-Separator Problem.
Proceedings of the International Conference on Control, 2014

2013
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem.
INFORMS J. Comput., 2013

Test-assignment: a quadratic coloring problem.
J. Heuristics, 2013

(k, c) - coloring via Column Generation.
Electron. Notes Discret. Math., 2013

Models for the two-dimensional two-stage cutting stock problem with multiple stock size.
Comput. Oper. Res., 2013

2012
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size.
Eur. J. Oper. Res., 2012

Exact weighted vertex coloring via branch-and-price.
Discret. Optim., 2012

2011
A Freight Service Design Problem for a Railway Corridor.
Transp. Sci., 2011

An exact approach for the Vertex Coloring Problem.
Discret. Optim., 2011

Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
Efficient and fair routing for mesh networks.
Math. Program., 2010

A survey on vertex coloring problems.
Int. Trans. Oper. Res., 2010

Algorithms for the Bin Packing Problem with Conflicts.
INFORMS J. Comput., 2010

2009
Models and heuristic algorithms for a weighted vertex coloring problem.
J. Heuristics, 2009

The Vertex Coloring Problem and its generalizations.
4OR, 2009

2008
A Metaheuristic Approach for the Vertex Coloring Problem.
INFORMS J. Comput., 2008

An evolutionary approach for bandwidth multicoloring problems.
Eur. J. Oper. Res., 2008


  Loading...