default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichele Monaci
Person information
- affiliation: Universit di Bologna, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j73]Mathijs Barkel
, Maxence Delorme, Enrico Malaguti, Michele Monaci:
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation. Eur. J. Oper. Res. 320(1): 57-68 (2025)- 2024
- [j72]Demetrio Laganà, Enrico Malaguti, Michele Monaci, Roberto Musmanno, Paolo Paronuzzi:
An iterated local search matheuristic approach for the multi-vehicle inventory routing problem. Comput. Oper. Res. 169: 106717 (2024) - [j71]Boris Detienne, Henri Lefebvre, Enrico Malaguti, Michele Monaci:
Adjustable robust optimization with objective uncertainty. Eur. J. Oper. Res. 312(1): 373-384 (2024) - [j70]Henri Lefebvre, Enrico Malaguti, Michele Monaci:
Adjustable Robust Optimization with Discrete Uncertainty. INFORMS J. Comput. 36(1): 78-96 (2024) - [j69]Andrea Lodi, Enrico Malaguti, Michele Monaci, Giacomo Nannicini, Paolo Paronuzzi:
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions. Math. Program. 205(1): 269-301 (2024) - 2023
- [j68]Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, Ulrich Pferschy:
Corrigendum to: 'Integer optimization with penalized fractional values: The Knapsack case' [European Journal of Operational Research (2019) 874-888]. Eur. J. Oper. Res. 307(2): 990 (2023) - [j67]Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis:
An exact method for binary fortification games. Eur. J. Oper. Res. 307(3): 1026-1039 (2023) - 2022
- [j66]Michele Monaci, Ciara Pike-Burke, Alberto Santini:
Exact algorithms for the 0-1 Time-Bomb Knapsack Problem. Comput. Oper. Res. 145: 105848 (2022) - [j65]Naga Venkata C. Gudapati, Enrico Malaguti, Michele Monaci:
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems. INFORMS J. Comput. 34(5): 2571-2582 (2022) - [j64]Enrico Malaguti, Michele Monaci, Jonas Pruente:
K-adaptability in stochastic optimization. Math. Program. 196(1): 567-595 (2022) - [j63]Manuel Iori, Vinícius Loti de Lima, Silvano Martello, Michele Monaci:
2DPackLib: a two-dimensional cutting and packing library. Optim. Lett. 16(2): 471-480 (2022) - 2021
- [j62]Vincenzo Bo, Marco Bortolini, Enrico Malaguti, Michele Monaci, Cristina Mora, Paolo Paronuzzi:
Models and algorithms for integrated production and distribution problems. Comput. Ind. Eng. 154: 107003 (2021) - [j61]Manuel Iori, Vinícius Loti de Lima, Silvano Martello, Flávio Keidi Miyazawa, Michele Monaci:
Exact solution techniques for two-dimensional cutting and packing. Eur. J. Oper. Res. 289(2): 399-415 (2021) - [j60]Gabriel Homsi, Jeremy Jordan, Silvano Martello, Michele Monaci:
The assignment and loading transportation problem. Eur. J. Oper. Res. 289(3): 999-1007 (2021) - [j59]Naga Venkata C. Gudapati, Enrico Malaguti, Michele Monaci:
In search of dense subgraphs: How good is greedy peeling? Networks 77(4): 572-586 (2021) - [i2]Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis:
An Exact Method for Fortification Games. CoRR abs/2111.13400 (2021) - 2020
- [j58]Claudia D'Ambrosio, Silvano Martello, Michele Monaci:
Lower and upper bounds for the non-linear generalized assignment problem. Comput. Oper. Res. 120: 104933 (2020) - [j57]Matteo Fischetti, Michele Monaci:
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming. Eur. J. Oper. Res. 282(2): 506-514 (2020) - [j56]Martina Fischetti, Jesper Runge Kristoffersen, Thomas Hjort, Michele Monaci, David Pisinger:
Vattenfall Optimizes Offshore Wind Farm Design. INFORMS J. Appl. Anal. 50(1): 80-94 (2020) - [c9]Alice Andalò, Giuseppe Calamia, Claudio Fabbri, Paolo Sabbatani, Michele Monaci, Stefano Severi, Cristiana Corsi:
High-resolution Catheters for Arrhythmic Driver Detection: Preliminary Results in Atrial Fibrillation. CinC 2020: 1-4
2010 – 2019
- 2019
- [j55]Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, Ulrich Pferschy:
Integer optimization with penalized fractional values: The Knapsack case. Eur. J. Oper. Res. 273(3): 874-888 (2019) - [j54]Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
Interdiction Games and Monotonicity, with Application to Knapsack Problems. INFORMS J. Comput. 31(2): 390-410 (2019) - [i1]Naga Venkata C. Gudapati, Enrico Malaguti, Michele Monaci:
In Search of Dense Subgraphs: How Good is Greedy Peeling? CoRR abs/1911.02356 (2019) - 2018
- [j53]Michele Monaci, André Gustavo dos Santos:
Minimum tiling of a rectangle by squares. Ann. Oper. Res. 271(2): 831-851 (2018) - [j52]Fabio Furini, Michele Monaci, Emiliano Traversi:
Exact approaches for the knapsack problem with setups. Comput. Oper. Res. 90: 208-220 (2018) - [j51]Matteo Fischetti, Michele Monaci, Domenico Salvagnin:
SelfSplit parallelization for mixed-integer linear programming. Comput. Oper. Res. 93: 101-112 (2018) - [j50]Matteo Fischetti, Michele Monaci, Markus Sinnl:
A dynamic reformulation heuristic for Generalized Interdiction Problems. Eur. J. Oper. Res. 267(1): 40-51 (2018) - [j49]Matteo Fischetti, Michael Kahr, Markus Leitner, Michele Monaci, Mario Ruthmair:
Least cost influence propagation in (social) networks. Math. Program. 170(1): 293-325 (2018) - [j48]Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
On the use of intersection cuts for bilevel optimization. Math. Program. 172(1-2): 77-103 (2018) - [j47]Claudia D'Ambrosio, Fabio Furini, Michele Monaci, Emiliano Traversi:
On the Product Knapsack Problem. Optim. Lett. 12(4): 691-712 (2018) - 2017
- [j46]Andrea Lodi, Michele Monaci, Enrico Pietrobuoni:
Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints. Discret. Appl. Math. 217: 40-47 (2017) - [j45]Matteo Fischetti, Michele Monaci:
Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling. Eur. J. Oper. Res. 263(1): 258-264 (2017) - [j44]Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. Oper. Res. 65(6): 1615-1637 (2017) - [j43]Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl:
Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9(2): 203-229 (2017) - 2016
- [j42]Alberto Caprara, Marco Locatelli, Michele Monaci:
Theoretical and computational results about optimality-based domain reductions. Comput. Optim. Appl. 64(2): 513-533 (2016) - [j41]Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez, Domenico Salvagnin:
On handling indicator constraints in mixed integer programming. Comput. Optim. Appl. 65(3): 545-566 (2016) - [j40]Matteo Fischetti, Michele Monaci, Domenico Salvagnin:
Mixed-integer linear programming heuristics for the prepack optimization problem. Discret. Optim. 22: 195-205 (2016) - [j39]Natashia Boland, Matteo Fischetti, Michele Monaci, Martin W. P. Savelsbergh:
Proximity Benders: a decomposition heuristic for stochastic programs. J. Heuristics 22(2): 181-198 (2016) - [j38]Martina Fischetti, Michele Monaci:
Proximity search heuristics for wind farm optimal layout. J. Heuristics 22(4): 459-474 (2016) - [j37]Matteo Fischetti, Andrea Lodi, Michele Monaci, Domenico Salvagnin, Andrea Tramontani:
Improving branch-and-cut performance by random sampling. Math. Program. Comput. 8(1): 113-132 (2016) - [c8]Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
Intersection Cuts for Bilevel Optimization. IPCO 2016: 77-88 - 2015
- [j36]Silvano Martello, Michele Monaci:
Models and algorithms for packing rectangles into the smallest square. Comput. Oper. Res. 63: 161-171 (2015) - 2014
- [j35]Matteo Fischetti, Michele Monaci:
Proximity search for 0-1 mixed-integer convex programming. J. Heuristics 20(6): 709-731 (2014) - [j34]Matteo Fischetti, Michele Monaci:
Exploiting Erraticism in Search. Oper. Res. 62(1): 114-122 (2014) - [j33]Giovanni Andreatta, Lorenzo Capanna, Luigi De Giovanni, Michele Monaci, Luca Righi:
Efficiency and Robustness in a Support Platform for Intelligent Airport Ground Handling. J. Intell. Transp. Syst. 18(1): 121-130 (2014) - [j32]Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci:
Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA. IEEE/ACM Trans. Netw. 22(5): 1645-1658 (2014) - [c7]Matteo Fischetti, Michele Monaci, Domenico Salvagnin:
Self-splitting of Workload in Parallel Computation. CPAIOR 2014: 394-404 - 2013
- [j31]Michele Monaci, Ulrich Pferschy, Paolo Serafini:
Exact solution of the robust knapsack problem. Comput. Oper. Res. 40(11): 2625-2631 (2013) - [j30]Matteo Fischetti, Michele Monaci:
Backdoor Branching. INFORMS J. Comput. 25(4): 693-700 (2013) - [j29]Michele Monaci, Ulrich Pferschy:
On the Robust Knapsack Problem. SIAM J. Optim. 23(4): 1956-1982 (2013) - 2012
- [j28]Mohammad Dolatabadi, Andrea Lodi, Michele Monaci:
Exact algorithms for the two-dimensional guillotine knapsack. Comput. Oper. Res. 39(1): 48-53 (2012) - [j27]Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci:
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem. J. Heuristics 18(6): 939-942 (2012) - [j26]Matteo Fischetti, Michele Monaci, Domenico Salvagnin:
Three Ideas for the Quadratic Assignment Problem. Oper. Res. 60(4): 954-964 (2012) - [j25]Matteo Fischetti, Michele Monaci:
Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Program. Comput. 4(3): 239-273 (2012) - [j24]Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger:
Complexity and approximation of an area packing problem. Optim. Lett. 6(1): 1-9 (2012) - [j23]Matteo Fischetti, Michele Monaci:
Branching on nonchimerical fractionalities. Oper. Res. Lett. 40(3): 159-164 (2012) - 2011
- [j22]Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci:
A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC. Comput. Networks 55(16): 3680-3693 (2011) - [j21]Enrico Malaguti, Michele Monaci, Paolo Toth:
An exact approach for the Vertex Coloring Problem. Discret. Optim. 8(2): 174-190 (2011) - [j20]Andrea Lodi, Silvano Martello, Michele Monaci, Claudio Cicconetti, Luciano Lenzini, Enzo Mingozzi, Carl Eklund, Jani Moilanen:
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX. Manag. Sci. 57(12): 2130-2144 (2011) - [c6]Michele Monaci, Ulrich Pferschy:
On the Robust Knapsack Problem. CTW 2011: 207-210 - [c5]Matteo Fischetti, Michele Monaci:
Backdoor Branching. IPCO 2011: 183-191 - 2010
- [j19]Alberto Caprara, Andrea Lodi, Michele Monaci:
An approximation scheme for the two-stage, two-dimensional knapsack problem. Discret. Optim. 7(3): 114-124 (2010) - [c4]Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci:
Efficient Two-dimensional Data Allocation in IEEE 802.16 OFDMA. INFOCOM 2010: 2160-2168
2000 – 2009
- 2009
- [j18]Maria Battarra, Michele Monaci, Daniele Vigo:
An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. Comput. Oper. Res. 36(11): 3041-3050 (2009) - [j17]Enrico Malaguti, Michele Monaci, Paolo Toth:
Models and heuristic algorithms for a weighted vertex coloring problem. J. Heuristics 15(5): 503-526 (2009) - [j16]Alberto Caprara, Michele Monaci:
Bidimensional packing by bilinear programming. Math. Program. 118(1): 75-108 (2009) - [p2]Matteo Fischetti, Michele Monaci:
Light Robustness. Robust and Online Large-Scale Optimization 2009: 61-84 - 2008
- [j15]Matteo Fischetti, Michele Monaci:
How tight is the corner relaxation? Discret. Optim. 5(2): 262-269 (2008) - [j14]Enrico Malaguti, Michele Monaci, Paolo Toth:
A Metaheuristic Approach for the Vertex Coloring Problem. INFORMS J. Comput. 20(2): 302-316 (2008) - [j13]Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci:
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem. INFORMS J. Comput. 20(3): 333-344 (2008) - 2007
- [j12]Mauro Dell'Amico, Michele Monaci, Corrado Pagani, Daniele Vigo:
Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows. Transp. Sci. 41(4): 516-526 (2007) - [p1]Alberto Caprara, Leo G. Kroon, Michele Monaci, Marc Peeters, Paolo Toth:
Chapter 3 Passenger Railway Optimization. Transportation 2007: 129-187 - 2006
- [j11]Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida:
A Lagrangian heuristic algorithm for a real-world train timetabling problem. Discret. Appl. Math. 154(5): 738-753 (2006) - [j10]Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci:
Packing into the smallest square: Worst-case analysis of lower bounds. Discret. Optim. 3(4): 317-326 (2006) - [j9]Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci:
Lower bounds and heuristic algorithms for the k. Eur. J. Oper. Res. 171(3): 725-742 (2006) - [j8]Michele Monaci, Paolo Toth:
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems. INFORMS J. Comput. 18(1): 71-85 (2006) - 2005
- [j7]Alberto Caprara, Andrea Lodi, Michele Monaci:
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing. Math. Oper. Res. 30(1): 150-172 (2005) - [c3]Alberto Caprara, Marco Locatelli, Michele Monaci:
Bidimensional Packing by Bilinear Programming. IPCO 2005: 377-391 - 2004
- [j6]Alberto Caprara, Michele Monaci:
On the two-dimensional Knapsack Problem. Oper. Res. Lett. 32(1): 5-14 (2004) - 2003
- [j5]Michele Monaci:
Algorithms for packing and scheduling problems. 4OR 1(1): 85-87 (2003) - [j4]Silvano Martello, Michele Monaci, Daniele Vigo:
An Exact Approach to the Strip-Packing Problem. INFORMS J. Comput. 15(3): 310-319 (2003) - [j3]Andrea Lodi, Michele Monaci:
Integer linear programming models for 2-staged two-dimensional Knapsack problems. Math. Program. 94(2-3): 257-278 (2003) - [j2]Alberto Caprara, Michele Monaci, Paolo Toth:
Models and algorithms for a staff scheduling problem. Math. Program. 98(1-3): 445-476 (2003) - 2002
- [j1]Andrea Lodi, Silvano Martello, Michele Monaci:
Two-dimensional packing problems: A survey. Eur. J. Oper. Res. 141(2): 241-252 (2002) - [c2]Alberto Caprara, Andrea Lodi, Michele Monaci:
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. IPCO 2002: 315-328 - 2001
- [c1]Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth:
Solution of Real-World Train Timetabling Problems. HICSS 2001
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
