Michele Monaci

Orcid: 0000-0001-9978-7613

  • Universit di Bologna, Italy

According to our database1, Michele Monaci authored at least 80 papers between 2001 and 2024.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


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

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

Adjustable Robust Optimization with Discrete Uncertainty.
INFORMS J. Comput., 2024

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

An exact method for binary fortification games.
Eur. J. Oper. Res., June, 2023

2DPackLib: a two-dimensional cutting and packing library.
Optim. Lett., 2022

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

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

Exact algorithms for the 0-1 Time-Bomb Knapsack Problem.
Comput. Oper. Res., 2022

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

Exact solution techniques for two-dimensional cutting and packing.
Eur. J. Oper. Res., 2021

The assignment and loading transportation problem.
Eur. J. Oper. Res., 2021

An Exact Method for Fortification Games.
CoRR, 2021

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

Vattenfall Optimizes Offshore Wind Farm Design.
INFORMS J. Appl. Anal., 2020

A branch-and-cut algorithm for Mixed-Integer Bilinear Programming.
Eur. J. Oper. Res., 2020

Lower and upper bounds for the non-linear generalized assignment problem.
Comput. Oper. Res., 2020

High-resolution Catheters for Arrhythmic Driver Detection: Preliminary Results in Atrial Fibrillation.
Proceedings of the Computing in Cardiology, 2020

Interdiction Games and Monotonicity, with Application to Knapsack Problems.
INFORMS J. Comput., 2019

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

On the Product Knapsack Problem.
Optim. Lett., 2018

On the use of intersection cuts for bilevel optimization.
Math. Program., 2018

Least cost influence propagation in (social) networks.
Math. Program., 2018

A dynamic reformulation heuristic for Generalized Interdiction Problems.
Eur. J. Oper. Res., 2018

Exact approaches for the knapsack problem with setups.
Comput. Oper. Res., 2018

SelfSplit parallelization for mixed-integer linear programming.
Comput. Oper. Res., 2018

Minimum tiling of a rectangle by squares.
Ann. Oper. Res., 2018

Thinning out Steiner trees: a node-based model for uniform edge costs.
Math. Program. Comput., 2017

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs.
Oper. Res., 2017

Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling.
Eur. J. Oper. Res., 2017

Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints.
Discret. Appl. Math., 2017

Improving branch-and-cut performance by random sampling.
Math. Program. Comput., 2016

Proximity search heuristics for wind farm optimal layout.
J. Heuristics, 2016

Proximity Benders: a decomposition heuristic for stochastic programs.
J. Heuristics, 2016

Mixed-integer linear programming heuristics for the prepack optimization problem.
Discret. Optim., 2016

Theoretical and computational results about optimality-based domain reductions.
Comput. Optim. Appl., 2016

On handling indicator constraints in mixed integer programming.
Comput. Optim. Appl., 2016

Intersection Cuts for Bilevel Optimization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

Models and algorithms for packing rectangles into the smallest square.
Comput. Oper. Res., 2015

Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA.
IEEE/ACM Trans. Netw., 2014

Efficiency and Robustness in a Support Platform for Intelligent Airport Ground Handling.
J. Intell. Transp. Syst., 2014

Exploiting Erraticism in Search.
Oper. Res., 2014

Proximity search for 0-1 mixed-integer convex programming.
J. Heuristics, 2014

Self-splitting of Workload in Parallel Computation.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

On the Robust Knapsack Problem.
SIAM J. Optim., 2013

Backdoor Branching.
INFORMS J. Comput., 2013

Exact solution of the robust knapsack problem.
Comput. Oper. Res., 2013

Branching on nonchimerical fractionalities.
Oper. Res. Lett., 2012

Complexity and approximation of an area packing problem.
Optim. Lett., 2012

Cutting plane versus compact formulations for uncertain (integer) linear programs.
Math. Program. Comput., 2012

Three Ideas for the Quadratic Assignment Problem.
Oper. Res., 2012

A note on exact and heuristic algorithms for the identical parallel machine scheduling problem.
J. Heuristics, 2012

Exact algorithms for the two-dimensional guillotine knapsack.
Comput. Oper. Res., 2012

Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX.
Manag. Sci., 2011

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

A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC.
Comput. Networks, 2011

An approximation scheme for the two-stage, two-dimensional knapsack problem.
Discret. Optim., 2010

Light Robustness.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Bidimensional packing by bilinear programming.
Math. Program., 2009

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

An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem.
Comput. Oper. Res., 2009

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

Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem.
INFORMS J. Comput., 2008

How tight is the corner relaxation?
Discret. Optim., 2008

Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows.
Transp. Sci., 2007

Chapter 3 Passenger Railway Optimization.
Proceedings of the Transportation, 2007

A Set-Covering-Based Heuristic Approach for Bin-Packing Problems.
INFORMS J. Comput., 2006

Lower bounds and heuristic algorithms for the k.
Eur. J. Oper. Res., 2006

Packing into the smallest square: Worst-case analysis of lower bounds.
Discret. Optim., 2006

A Lagrangian heuristic algorithm for a real-world train timetabling problem.
Discret. Appl. Math., 2006

Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing.
Math. Oper. Res., 2005

Bidimensional Packing by Bilinear Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

On the two-dimensional Knapsack Problem.
Oper. Res. Lett., 2004

Integer linear programming models for 2-staged two-dimensional Knapsack problems.
Math. Program., 2003

Models and algorithms for a staff scheduling problem.
Math. Program., 2003

An Exact Approach to the Strip-Packing Problem.
INFORMS J. Comput., 2003

Algorithms for packing and scheduling problems.
4OR, 2003

Two-dimensional packing problems: A survey.
Eur. J. Oper. Res., 2002

An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

Solution of Real-World Train Timetabling Problems.
Proceedings of the 34th Annual Hawaii International Conference on System Sciences (HICSS-34), 2001