default search action
Enrico Malaguti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j53]Mathijs Barkel
, Maxence Delorme
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation. Eur. J. Oper. Res. 320(1): 57-68 (2025) - 2024
- [j52]Demetrio Laganà
An iterated local search matheuristic approach for the multi-vehicle inventory routing problem. Comput. Oper. Res. 169: 106717 (2024) - [j51]Boris Detienne
Adjustable robust optimization with objective uncertainty. Eur. J. Oper. Res. 312(1): 373-384 (2024) - [j50]Alberto Santini
The min-Knapsack problem with compactness constraints and applications in statistics. Eur. J. Oper. Res. 312(1): 385-397 (2024) - [j49]Henri Lefebvre
Adjustable Robust Optimization with Discrete Uncertainty. INFORMS J. Comput. 36(1): 78-96 (2024) - [j48]Andrea Lodi
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions. Math. Program. 205(1): 269-301 (2024) - 2023
- [j47]Cristiano Fabbri
A decision support system for scheduling a vaccination campaign during a pandemic emergency: The COVID-19 case. Comput. Ind. Eng. 177: 109068 (2023) - [j46]Enrico Malaguti, Vagner Pedrotti
Models and algorithms for the Weighted Safe Set Problem. Discret. Appl. Math. 329: 23-34 (2023) - [j45]Enrico Malaguti
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) - [j44]Giampaolo Campana
Scheduling of semi-automatic carousels with fixed production sequences. Int. J. Prod. Res. 61(4): 1252-1267 (2023) - 2022
- [j43]Naga Venkata C. Gudapati
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems. INFORMS J. Comput. 34(5): 2571-2582 (2022) - [j42]Fabio Furini
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem. Oper. Res. 70(4): 2399-2420 (2022) - [j41]Andrea Lodi
Nonlinear chance-constrained problems with applications to hydro scheduling. Math. Program. 191(1): 405-444 (2022) - [j40]Enrico Malaguti, Michele Monaci
K-adaptability in stochastic optimization. Math. Program. 196(1): 567-595 (2022) - 2021
- [j39]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) - [j38]Diego Delle Donne
A branch-and-price algorithm for the Minimum Sum Coloring Problem. Discret. Appl. Math. 303: 39-56 (2021) - [j37]Torkil Kollsker, Enrico Malaguti
Models and algorithms for optimising two-dimensional LEGO constructions. Eur. J. Oper. Res. 289(1): 270-284 (2021) - [j36]Valentina Cacchiani
Guest Editorial to the Feature Cluster "New Trends in Applied Combinatorial Optimization" (EURO/ALIO 2018). Eur. J. Oper. Res. 289(3): 807-808 (2021) - [j35]Naga Venkata C. Gudapati, Enrico Malaguti
In search of dense subgraphs: How good is greedy peeling? Networks 77(4): 572-586 (2021) - [c3]Enrico Malaguti, Vagner Pedrotti:
A new formulation for the Weighted Safe Set Problem. LAGOS 2021: 508-515 - 2020
- [j34]Fabio Furini
On integer and bilevel formulations for the k-vertex cut problem. Math. Program. Comput. 12(2): 133-164 (2020) - [j33]Sergio Callegari
Discrete Programming Entailing Circulant Quadratic Forms: Refinement of a Heuristic Approach Based on ΔΣ Modulation. IEEE Trans. Circuits Syst. II Express Briefs 67-II(5): 926-930 (2020)
2010 – 2019
- 2019
- [j32]Enrico Malaguti, Rosa Medina Durán
Computing k different solutions to the assignment problem. Comput. Ind. Eng. 135: 528-536 (2019) - [j31]Denis Cornaz, Fabio Furini
The vertex k-cut problem. Discret. Optim. 31: 8-28 (2019) - [j30]Enrico Malaguti, Michele Monaci
Integer optimization with penalized fractional values: The Knapsack case. Eur. J. Oper. Res. 273(3): 874-888 (2019) - [j29]Denis Cornaz, Fabio Furini
A note on selective line-graphs and partition colorings. Oper. Res. Lett. 47(6): 565-568 (2019) - [i2]Naga Venkata C. Gudapati, Enrico Malaguti, Michele Monaci:
In Search of Dense Subgraphs: How Good is Greedy Peeling? CoRR abs/1911.02356 (2019) - 2018
- [j28]Fabio Furini
An exact algorithm for the Partition Coloring Problem. Comput. Oper. Res. 92: 170-181 (2018) - [j27]Enrico Malaguti, Giacomo Nannicini, Dimitri Thomopulos
Optimizing allocation in a warehouse network. Electron. Notes Discret. Math. 64: 195-204 (2018) - [j26]Fabio Furini
ILP Models and Column Generation for the Minimum Sum Coloring Problem. Electron. Notes Discret. Math. 64: 215-224 (2018) - [j25]Valentina Cacchiani
Preface. Electron. Notes Discret. Math. 69: 1-3 (2018) - 2017
- [j24]Gianluca Costa, Maxence Delorme
Training software for orthogonal packing problems. Comput. Ind. Eng. 111: 139-147 (2017) - [j23]Denis Cornaz, Fabio Furini
Solving vertex coloring problems as maximum weight stable set problems. Discret. Appl. Math. 217: 151-162 (2017) - [j22]Andrea Bettinelli
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph. INFORMS J. Comput. 29(3): 457-473 (2017) - 2016
- [j21]Fabio Furini
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming. INFORMS J. Comput. 28(4): 736-751 (2016) - [j20]Alberto Caprara, Fabio Furini
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation. Inf. Process. Lett. 116(5): 379-386 (2016) - [j19]Andrea Lodi, Enrico Malaguti, Nicolás E. Stier Moses
Design and Control of Public-Service Contracts and an Application to Public Transportation Systems. Manag. Sci. 62(4): 1165-1187 (2016) - [j18]Enrico Malaguti, Rosa Medina Durán
A metaheuristic framework for Nonlinear Capacitated Covering Problems. Optim. Lett. 10(1): 169-180 (2016) - 2015
- [j17]Martin Bergner, Alberto Caprara, Alberto Ceselli
Automatic Dantzig-Wolfe reformulation of mixed integer programs. Math. Program. 149(1-2): 391-424 (2015) - [j16]Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront
A branch-and-price algorithm for the (k, c)-coloring problem. Networks 65(4): 353-366 (2015) - [i1]Denis Cornaz, Fabio Furini, Enrico Malaguti:
Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems. CTW 2015: 36-39 - 2014
- [c2]Denis Cornaz, Fabio Furini
Mathematical formulations for the Balanced Vertex k-Separator Problem. CoDIT 2014: 176-181 - 2013
- [j15]Fabio Furini
Models for the two-dimensional two-stage cutting stock problem with multiple stock size. Comput. Oper. Res. 40(8): 1953-1962 (2013) - [j14]Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront
(k, c) - coloring via Column Generation. Electron. Notes Discret. Math. 41: 447-454 (2013) - [j13]Jelle Duives, Andrea Lodi, Enrico Malaguti:
Test-assignment: a quadratic coloring problem. J. Heuristics 19(4): 549-564 (2013) - [j12]Alberto Caprara, Fabio Furini
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem. INFORMS J. Comput. 25(3): 560-571 (2013) - 2012
- [j11]Fabio Furini
Exact weighted vertex coloring via branch-and-price. Discret. Optim. 9(2): 130-136 (2012) - [j10]Fabio Furini
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. Eur. J. Oper. Res. 218(1): 251-260 (2012) - 2011
- [j9]Enrico Malaguti, Michele Monaci
An exact approach for the Vertex Coloring Problem. Discret. Optim. 8(2): 174-190 (2011) - [j8]Alberto Caprara, Enrico Malaguti, Paolo Toth:
A Freight Service Design Problem for a Railway Corridor. Transp. Sci. 45(2): 147-162 (2011) - [c1]Martin Bergner, Alberto Caprara, Fabio Furini
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. IPCO 2011: 39-51 - 2010
- [j7]Albert Einstein Fernandes Muritiba, Manuel Iori
Algorithms for the Bin Packing Problem with Conflicts. INFORMS J. Comput. 22(3): 401-415 (2010) - [j6]Enrico Malaguti, Paolo Toth:
A survey on vertex coloring problems. Int. Trans. Oper. Res. 17(1): 1-34 (2010) - [j5]Andrea Lodi, Enrico Malaguti, Nicolás E. Stier Moses
Efficient and fair routing for mesh networks. Math. Program. 124(1-2): 285-316 (2010)
2000 – 2009
- 2009
- [j4]Enrico Malaguti:
The Vertex Coloring Problem and its generalizations. 4OR 7(1): 101-104 (2009) - [j3]Enrico Malaguti, Michele Monaci
Models and heuristic algorithms for a weighted vertex coloring problem. J. Heuristics 15(5): 503-526 (2009) - 2008
- [j2]Enrico Malaguti, Paolo Toth:
An evolutionary approach for bandwidth multicoloring problems. Eur. J. Oper. Res. 189(3): 638-651 (2008) - [j1]Enrico Malaguti, Michele Monaci
A Metaheuristic Approach for the Vertex Coloring Problem. INFORMS J. Comput. 20(2): 302-316 (2008)
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:32 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: