Michele Monaci

87 papers A* 1B 5C 1Journal 76Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
A computational study on Integer Programming formulations for Hop-constrained survivable network design.
Discret. Appl. Math.
Naga Venkata C. Gudapati, Enrico Malaguti, Michele Monaci, Paolo Paronuzzi
2025 J jnl
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation.
Eur. J. Oper. Res.
Mathijs Barkel, Maxence Delorme, Enrico Malaguti, Michele Monaci
2024 J jnl
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions.
Math. Program.
Andrea Lodi, Enrico Malaguti, Michele Monaci, Giacomo Nannicini, Paolo Paronuzzi
2024 J jnl
Adjustable Robust Optimization with Discrete Uncertainty.
INFORMS J. Comput.
Henri Lefebvre, Enrico Malaguti, Michele Monaci
2024 J jnl
Adjustable robust optimization with objective uncertainty.
Eur. J. Oper. Res.
Boris Detienne, Henri Lefebvre, Enrico Malaguti, Michele Monaci
2024 J jnl
An iterated local search matheuristic approach for the multi-vehicle inventory routing problem.
Comput. Oper. Res.
Demetrio Laganà, Enrico Malaguti, Michele Monaci, Roberto Musmanno, Paolo Paronuzzi
2023 J jnl
An exact method for binary fortification games.
Eur. J. Oper. Res.
Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis
2023 J jnl
Corrigendum to: 'Integer optimization with penalized fractional values: The Knapsack case' [European Journal of Operational Research (2019) 874-888].
Eur. J. Oper. Res.
Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, Ulrich Pferschy
2022 J jnl
2DPackLib: a two-dimensional cutting and packing library.
Optim. Lett.
Manuel Iori, Vinícius Loti de Lima, Silvano Martello, Michele Monaci
2022 J jnl
Exact algorithms for the 0-1 Time-Bomb Knapsack Problem.
Comput. Oper. Res.
Michele Monaci, Ciara Pike-Burke, Alberto Santini
2022 J jnl
K-adaptability in stochastic optimization.
Math. Program.
Enrico Malaguti, Michele Monaci, Jonas Pruente
2022 J jnl
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems.
INFORMS J. Comput.
Naga Venkata C. Gudapati, Enrico Malaguti, Michele Monaci
2021 J jnl
An Exact Method for Fortification Games.
CoRR
Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis
2021 J jnl
Exact solution techniques for two-dimensional cutting and packing.
Eur. J. Oper. Res.
Manuel Iori, Vinícius Loti de Lima, Silvano Martello, Flávio Keidi Miyazawa, Michele Monaci
2021 J jnl
In search of dense subgraphs: How good is greedy peeling?
Networks
Naga Venkata C. Gudapati, Enrico Malaguti, Michele Monaci
2021 J jnl
Models and algorithms for integrated production and distribution problems.
Comput. Ind. Eng.
Vincenzo Bo, Marco Bortolini, Enrico Malaguti, Michele Monaci, Cristina Mora, Paolo Paronuzzi
2021 J jnl
The assignment and loading transportation problem.
Eur. J. Oper. Res.
Gabriel Homsi, Jeremy Jordan, Silvano Martello, Michele Monaci
2020 J jnl
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming.
Eur. J. Oper. Res.
Matteo Fischetti, Michele Monaci
2020 — conf
High-resolution Catheters for Arrhythmic Driver Detection: Preliminary Results in Atrial Fibrillation.
CinC
Alice Andalò, Giuseppe Calamia, Claudio Fabbri, Paolo Sabbatani, Michele Monaci, Stefano Severi, Cristiana Corsi
2020 J jnl
Lower and upper bounds for the non-linear generalized assignment problem.
Comput. Oper. Res.
Claudia D'Ambrosio, Silvano Martello, Michele Monaci
2020 J jnl
Vattenfall Optimizes Offshore Wind Farm Design.
INFORMS J. Appl. Anal.
Martina Fischetti, Jesper Runge Kristoffersen, Thomas Hjort, Michele Monaci, David Pisinger
2019 J jnl
In Search of Dense Subgraphs: How Good is Greedy Peeling?
CoRR
Naga Venkata C. Gudapati, Enrico Malaguti, Michele Monaci
2019 J jnl
Integer optimization with penalized fractional values: The Knapsack case.
Eur. J. Oper. Res.
Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, Ulrich Pferschy
2019 J jnl
Interdiction Games and Monotonicity, with Application to Knapsack Problems.
INFORMS J. Comput.
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2018 J jnl
A dynamic reformulation heuristic for Generalized Interdiction Problems.
Eur. J. Oper. Res.
Matteo Fischetti, Michele Monaci, Markus Sinnl
2018 J jnl
Exact approaches for the knapsack problem with setups.
Comput. Oper. Res.
Fabio Furini, Michele Monaci, Emiliano Traversi
2018 J jnl
Least cost influence propagation in (social) networks.
Math. Program.
Matteo Fischetti, Michael Kahr, Markus Leitner, Michele Monaci, Mario Ruthmair
2018 J jnl
Minimum tiling of a rectangle by squares.
Ann. Oper. Res.
Michele Monaci, André Gustavo dos Santos
2018 J jnl
On the Product Knapsack Problem.
Optim. Lett.
Claudia D'Ambrosio, Fabio Furini, Michele Monaci, Emiliano Traversi
2018 J jnl
On the use of intersection cuts for bilevel optimization.
Math. Program.
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2018 J jnl
SelfSplit parallelization for mixed-integer linear programming.
Comput. Oper. Res.
Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2017 J jnl
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs.
Oper. Res.
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2017 J jnl
Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints.
Discret. Appl. Math.
Andrea Lodi, Michele Monaci, Enrico Pietrobuoni
2017 J jnl
Thinning out Steiner trees: a node-based model for uniform edge costs.
Math. Program. Comput.
Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl
2017 J jnl
Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling.
Eur. J. Oper. Res.
Matteo Fischetti, Michele Monaci
2016 J jnl
Improving branch-and-cut performance by random sampling.
Math. Program. Comput.
Matteo Fischetti, Andrea Lodi, Michele Monaci, Domenico Salvagnin, Andrea Tramontani
2016 B conf
Intersection Cuts for Bilevel Optimization.
IPCO
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2016 J jnl
Mixed-integer linear programming heuristics for the prepack optimization problem.
Discret. Optim.
Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2016 J jnl
On handling indicator constraints in mixed integer programming.
Comput. Optim. Appl.
Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez, Domenico Salvagnin
2016 J jnl
Proximity Benders: a decomposition heuristic for stochastic programs.
J. Heuristics
Natashia Boland, Matteo Fischetti, Michele Monaci, Martin W. P. Savelsbergh
2016 J jnl
Proximity search heuristics for wind farm optimal layout.
J. Heuristics
Martina Fischetti, Michele Monaci
2016 J jnl
Theoretical and computational results about optimality-based domain reductions.
Comput. Optim. Appl.
Alberto Caprara, Marco Locatelli, Michele Monaci
2015 J jnl
Models and algorithms for packing rectangles into the smallest square.
Comput. Oper. Res.
Silvano Martello, Michele Monaci
2014 J jnl
Efficiency and Robustness in a Support Platform for Intelligent Airport Ground Handling.
J. Intell. Transp. Syst.
Giovanni Andreatta, Lorenzo Capanna, Luigi De Giovanni, Michele Monaci, Luca Righi
2014 J jnl
Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA.
IEEE/ACM Trans. Netw.
Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci
2014 J jnl
Exploiting Erraticism in Search.
Oper. Res.
Matteo Fischetti, Michele Monaci
2014 J jnl
Proximity search for 0-1 mixed-integer convex programming.
J. Heuristics
Matteo Fischetti, Michele Monaci
2014 B conf
Self-splitting of Workload in Parallel Computation.
CPAIOR
Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2013 J jnl
Backdoor Branching.
INFORMS J. Comput.
Matteo Fischetti, Michele Monaci
2013 J jnl
Exact solution of the robust knapsack problem.
Comput. Oper. Res.
Michele Monaci, Ulrich Pferschy, Paolo Serafini
2013 J jnl
On the Robust Knapsack Problem.
SIAM J. Optim.
Michele Monaci, Ulrich Pferschy
2012 J jnl
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem.
J. Heuristics
Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci
2012 J jnl
Branching on nonchimerical fractionalities.
Oper. Res. Lett.
Matteo Fischetti, Michele Monaci
2012 J jnl
Complexity and approximation of an area packing problem.
Optim. Lett.
Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger
2012 J jnl
Cutting plane versus compact formulations for uncertain (integer) linear programs.
Math. Program. Comput.
Matteo Fischetti, Michele Monaci
2012 J jnl
Exact algorithms for the two-dimensional guillotine knapsack.
Comput. Oper. Res.
Mohammad Dolatabadi, Andrea Lodi, Michele Monaci
2012 J jnl
Three Ideas for the Quadratic Assignment Problem.
Oper. Res.
Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2011 J jnl
A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC.
Comput. Networks
Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci
2011 J jnl
An exact approach for the Vertex Coloring Problem.
Discret. Optim.
Enrico Malaguti, Michele Monaci, Paolo Toth
2011 B conf
Backdoor Branching.
IPCO
Matteo Fischetti, Michele Monaci
2011 J jnl
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX.
Manag. Sci.
Andrea Lodi, Silvano Martello, Michele Monaci, Claudio Cicconetti, Luciano Lenzini, Enzo Mingozzi, Carl Eklund, Jani Moilanen
2011 C conf
On the Robust Knapsack Problem.
CTW
Michele Monaci, Ulrich Pferschy
2010 J jnl
An approximation scheme for the two-stage, two-dimensional knapsack problem.
Discret. Optim.
Alberto Caprara, Andrea Lodi, Michele Monaci
2010 A* conf
Efficient Two-dimensional Data Allocation in IEEE 802.16 OFDMA.
INFOCOM
Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci
2009 J jnl
An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem.
Comput. Oper. Res.
Maria Battarra, Michele Monaci, Daniele Vigo
2009 J jnl
Bidimensional packing by bilinear programming.
Math. Program.
Alberto Caprara, Michele Monaci
2009 — ch.
Light Robustness.
Robust and Online Large-Scale Optimization
Matteo Fischetti, Michele Monaci
2009 J jnl
Models and heuristic algorithms for a weighted vertex coloring problem.
J. Heuristics
Enrico Malaguti, Michele Monaci, Paolo Toth
2008 J jnl
A Metaheuristic Approach for the Vertex Coloring Problem.
INFORMS J. Comput.
Enrico Malaguti, Michele Monaci, Paolo Toth
2008 J jnl
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem.
INFORMS J. Comput.
Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci
2008 J jnl
How tight is the corner relaxation?
Discret. Optim.
Matteo Fischetti, Michele Monaci
2007 — ch.
Chapter 3 Passenger Railway Optimization.
Transportation
Alberto Caprara, Leo G. Kroon, Michele Monaci, Marc Peeters, Paolo Toth
2007 J jnl
Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows.
Transp. Sci.
Mauro Dell'Amico, Michele Monaci, Corrado Pagani, Daniele Vigo
2006 J jnl
A Lagrangian heuristic algorithm for a real-world train timetabling problem.
Discret. Appl. Math.
Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida
2006 J jnl
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems.
INFORMS J. Comput.
Michele Monaci, Paolo Toth
2006 J jnl
Lower bounds and heuristic algorithms for the k.
Eur. J. Oper. Res.
Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci
2006 J jnl
Packing into the smallest square: Worst-case analysis of lower bounds.
Discret. Optim.
Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci
2005 B conf
Bidimensional Packing by Bilinear Programming.
IPCO
Alberto Caprara, Marco Locatelli, Michele Monaci
2005 J jnl
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing.
Math. Oper. Res.
Alberto Caprara, Andrea Lodi, Michele Monaci
2004 J jnl
On the two-dimensional Knapsack Problem.
Oper. Res. Lett.
Alberto Caprara, Michele Monaci
2003 J jnl
Algorithms for packing and scheduling problems.
4OR
Michele Monaci
2003 J jnl
An Exact Approach to the Strip-Packing Problem.
INFORMS J. Comput.
Silvano Martello, Michele Monaci, Daniele Vigo
2003 J jnl
Integer linear programming models for 2-staged two-dimensional Knapsack problems.
Math. Program.
Andrea Lodi, Michele Monaci
2003 J jnl
Models and algorithms for a staff scheduling problem.
Math. Program.
Alberto Caprara, Michele Monaci, Paolo Toth
2002 B conf
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem.
IPCO
Alberto Caprara, Andrea Lodi, Michele Monaci
2002 J jnl
Two-dimensional packing problems: A survey.
Eur. J. Oper. Res.
Andrea Lodi, Silvano Martello, Michele Monaci
2001 — conf
Solution of Real-World Train Timetabling Problems.
HICSS
Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth