Solution of Real-World Train Timetabling Problems. - Alberto Caprara; Matteo Fischetti; Pier Luigi Guida; Michele Monaci; Giuseppe Sacco; Paolo Toth (HICSS, 2001)

An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. - Alberto Caprara; Andrea Lodi 001; Michele Monaci (IPCO, 2002)

Two-dimensional packing problems: A survey. - Andrea Lodi 001; Silvano Martello; Michele Monaci (Eur. J. Oper. Res., 2002)

Algorithms for packing and scheduling problems. - Michele Monaci (4OR, 2003)

An Exact Approach to the Strip-Packing Problem. - Silvano Martello; Michele Monaci; Daniele Vigo (INFORMS J. Comput., 2003)

Models and algorithms for a staff scheduling problem. - Alberto Caprara; Michele Monaci; Paolo Toth (Math. Program., 2003)

Integer linear programming models for 2-staged two-dimensional Knapsack problems. - Andrea Lodi 001; Michele Monaci (Math. Program., 2003)

On the two-dimensional Knapsack Problem. - Alberto Caprara; Michele Monaci (Oper. Res. Lett., 2004)

Bidimensional Packing by Bilinear Programming. - Alberto Caprara; Marco Locatelli 001; Michele Monaci (IPCO, 2005)

Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing. - Alberto Caprara; Andrea Lodi 001; Michele Monaci (Math. Oper. Res., 2005)

A Lagrangian heuristic algorithm for a real-world train timetabling problem. - Alberto Caprara; Michele Monaci; Paolo Toth; Pier Luigi Guida (Discret. Appl. Math., 2006)

Packing into the smallest square: Worst-case analysis of lower bounds. - Alberto Caprara; Andrea Lodi 001; Silvano Martello; Michele Monaci (Discret. Optim., 2006)

Lower bounds and heuristic algorithms for the k. - Mauro Dell'Amico; Manuel Iori; Silvano Martello; Michele Monaci (Eur. J. Oper. Res., 2006)

A Set-Covering-Based Heuristic Approach for Bin-Packing Problems. - Michele Monaci; Paolo Toth (INFORMS J. Comput., 2006)

Chapter 3 Passenger Railway Optimization. - Alberto Caprara; Leo G. Kroon; Michele Monaci; Marc Peeters; Paolo Toth (Transportation, 2007)

Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows. - Mauro Dell'Amico; Michele Monaci; Corrado Pagani; Daniele Vigo (Transp. Sci., 2007)

How tight is the corner relaxation? - Matteo Fischetti; Michele Monaci (Discret. Optim., 2008)

Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem. - Mauro Dell'Amico; Manuel Iori; Silvano Martello; Michele Monaci (INFORMS J. Comput., 2008)

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

An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. - Maria Battarra; Michele Monaci; Daniele Vigo (Comput. Oper. Res., 2009)

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

Bidimensional packing by bilinear programming. - Alberto Caprara; Michele Monaci (Math. Program., 2009)

Light Robustness. - Matteo Fischetti; Michele Monaci (Robust and Online Large-Scale Optimization, 2009)

An approximation scheme for the two-stage, two-dimensional knapsack problem. - Alberto Caprara; Andrea Lodi 001; Michele Monaci (Discret. Optim., 2010)

A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC. - Claudio Cicconetti; Luciano Lenzini; Andrea Lodi 001; Silvano Martello; Enzo Mingozzi; Michele Monaci (Comput. Networks, 2011)

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

Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX. - Andrea Lodi 001; Silvano Martello; Michele Monaci; Claudio Cicconetti; Luciano Lenzini; Enzo Mingozzi; Carl Eklund; Jani Moilanen (Manag. Sci., 2011)

Exact algorithms for the two-dimensional guillotine knapsack. - Mohammad Dolatabadi; Andrea Lodi 001; Michele Monaci (Comput. Oper. Res., 2012)

A note on exact and heuristic algorithms for the identical parallel machine scheduling problem. - Mauro Dell'Amico; Manuel Iori; Silvano Martello; Michele Monaci (J. Heuristics, 2012)

Three Ideas for the Quadratic Assignment Problem. - Matteo Fischetti; Michele Monaci; Domenico Salvagnin (Oper. Res., 2012)

Cutting plane versus compact formulations for uncertain (integer) linear programs. - Matteo Fischetti; Michele Monaci (Math. Program. Comput., 2012)

Complexity and approximation of an area packing problem. - Cor A. J. Hurkens; Andrea Lodi 001; Silvano Martello; Michele Monaci; Gerhard J. Woeginger (Optim. Lett., 2012)

Branching on nonchimerical fractionalities. - Matteo Fischetti; Michele Monaci (Oper. Res. Lett., 2012)

Exact solution of the robust knapsack problem. - Michele Monaci; Ulrich Pferschy; Paolo Serafini (Comput. Oper. Res., 2013)

Backdoor Branching. - Matteo Fischetti; Michele Monaci (INFORMS J. Comput., 2013)

On the Robust Knapsack Problem. - Michele Monaci; Ulrich Pferschy (SIAM J. Optim., 2013)

Self-splitting of Workload in Parallel Computation. - Matteo Fischetti; Michele Monaci; Domenico Salvagnin (CPAIOR, 2014)

Proximity search for 0-1 mixed-integer convex programming. - Matteo Fischetti; Michele Monaci (J. Heuristics, 2014)

Exploiting Erraticism in Search. - Matteo Fischetti; Michele Monaci (Oper. Res., 2014)

Efficiency and Robustness in a Support Platform for Intelligent Airport Ground Handling. - Giovanni Andreatta; Lorenzo Capanna; Luigi De Giovanni; Michele Monaci; Luca Righi (J. Intell. Transp. Syst., 2014)

Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA. - Claudio Cicconetti; Luciano Lenzini; Andrea Lodi 001; Silvano Martello; Enzo Mingozzi; Michele Monaci (IEEE/ACM Trans. Netw., 2014)

Models and algorithms for packing rectangles into the smallest square. - Silvano Martello; Michele Monaci (Comput. Oper. Res., 2015)

Intersection Cuts for Bilevel Optimization. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (IPCO, 2016)

On handling indicator constraints in mixed integer programming. - Pietro Belotti; Pierre Bonami; Matteo Fischetti; Andrea Lodi 001; Michele Monaci; Amaya Nogales-Gómez; Domenico Salvagnin (Comput. Optim. Appl., 2016)

Theoretical and computational results about optimality-based domain reductions. - Alberto Caprara; Marco Locatelli 001; Michele Monaci (Comput. Optim. Appl., 2016)

Mixed-integer linear programming heuristics for the prepack optimization problem. - Matteo Fischetti; Michele Monaci; Domenico Salvagnin (Discret. Optim., 2016)

Proximity Benders: a decomposition heuristic for stochastic programs. - Natashia Boland; Matteo Fischetti; Michele Monaci; Martin W. P. Savelsbergh (J. Heuristics, 2016)

Proximity search heuristics for wind farm optimal layout. - Martina Fischetti; Michele Monaci (J. Heuristics, 2016)

Improving branch-and-cut performance by random sampling. - Matteo Fischetti; Andrea Lodi 001; Michele Monaci; Domenico Salvagnin; Andrea Tramontani (Math. Program. Comput., 2016)

Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints. - Andrea Lodi 001; Michele Monaci; Enrico Pietrobuoni (Discret. Appl. Math., 2017)

Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling. - Matteo Fischetti; Michele Monaci (Eur. J. Oper. Res., 2017)

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (Oper. Res., 2017)

Thinning out Steiner trees: a node-based model for uniform edge costs. - Matteo Fischetti; Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Michele Monaci; Max Resch; Domenico Salvagnin; Markus Sinnl (Math. Program. Comput., 2017)

Minimum tiling of a rectangle by squares. - Michele Monaci; André Gustavo dos Santos (Ann. Oper. Res., 2018)

SelfSplit parallelization for mixed-integer linear programming. - Matteo Fischetti; Michele Monaci; Domenico Salvagnin (Comput. Oper. Res., 2018)

Exact approaches for the knapsack problem with setups. - Fabio Furini; Michele Monaci; Emiliano Traversi (Comput. Oper. Res., 2018)

A dynamic reformulation heuristic for Generalized Interdiction Problems. - Matteo Fischetti; Michele Monaci; Markus Sinnl (Eur. J. Oper. Res., 2018)

Least cost influence propagation in (social) networks. - Matteo Fischetti; Michael Kahr; Markus Leitner; Michele Monaci; Mario Ruthmair (Math. Program., 2018)

On the use of intersection cuts for bilevel optimization. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (Math. Program., 2018)

On the Product Knapsack Problem. - Claudia D'Ambrosio; Fabio Furini; Michele Monaci; Emiliano Traversi (Optim. Lett., 2018)

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

Interdiction Games and Monotonicity, with Application to Knapsack Problems. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (INFORMS J. Comput., 2019)

High-resolution Catheters for Arrhythmic Driver Detection: Preliminary Results in Atrial Fibrillation. - Alice Andalò; Giuseppe Calamia; Claudio Fabbri; Paolo Sabbatani; Michele Monaci; Stefano Severi; Cristiana Corsi (CinC, 2020)

Lower and upper bounds for the non-linear generalized assignment problem. - Claudia D'Ambrosio; Silvano Martello; Michele Monaci (Comput. Oper. Res., 2020)

A branch-and-cut algorithm for Mixed-Integer Bilinear Programming. - Matteo Fischetti; Michele Monaci (Eur. J. Oper. Res., 2020)

Vattenfall Optimizes Offshore Wind Farm Design. - Martina Fischetti; Jesper Runge Kristoffersen; Thomas Hjort; Michele Monaci; David Pisinger (INFORMS J. Appl. Anal., 2020)

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)

An Exact Method for Fortification Games. - Markus Leitner; Ivana Ljubic; Michele Monaci; Markus Sinnl; Kübra Taninmis (CoRR, 2021)

The assignment and loading transportation problem. - Gabriel Homsi; Jeremy Jordan; Silvano Martello; Michele Monaci (Eur. J. Oper. Res., 2021)

Exact solution techniques for two-dimensional cutting and packing. - Manuel Iori; Vinícius Loti de Lima; Silvano Martello; Flávio Keidi Miyazawa; Michele Monaci (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)

Exact algorithms for the 0-1 Time-Bomb Knapsack Problem. - Michele Monaci; Ciara Pike-Burke; Alberto Santini (Comput. Oper. Res., 2022)

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

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

2DPackLib: a two-dimensional cutting and packing library. - Manuel Iori; Vinícius Loti de Lima; Silvano Martello; Michele Monaci (Optim. Lett., 2022)

An exact method for binary fortification games. - Markus Leitner; Ivana Ljubic; Michele Monaci; Markus Sinnl; Kübra Taninmis (Eur. J. Oper. Res., 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)

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)