default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMassimiliano Caramia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j66]Massimiliano Caramia
, Giuseppe Stecca:
An Improved Negotiation-Based Approach for Collecting and Sorting Operations in Waste Management and Recycling. Algorithms 17(9): 380 (2024)- [j65]Lucio Bianco, Massimiliano Caramia, Stefano Giordani, Alessio Salvatore:
Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm. Ann. Oper. Res. 338(1): 193-224 (2024) - [j64]Lucio Bianco, Massimiliano Caramia, Stefano Giordani, Alessio Salvatore:
On the concept of criticality on GPRs project network with variable activity durations. Comput. Ind. Eng. 192: 110184 (2024) - [j63]Massimiliano Caramia, Emanuele Pizzari:
Novel bilevel formulations for waste management. Discret. Appl. Math. 354: 181-198 (2024) - 2023
- [j62]Massimiliano Caramia:
"Multi-Objective and Multi-Level Optimization: Algorithms and Applications": Foreword by the Guest Editor. Algorithms 16(9): 425 (2023) - [j61]Massimiliano Caramia, Diego Maria Pinto, Emanuele Pizzari, Giuseppe Stecca:
Clustering and routing in waste management: A two-stage optimisation approach. EURO J. Transp. Logist. 12: 100114 (2023) - 2022
- [j60]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa, Jean-François Mascari:
A tight relation between series-parallel graphs and bipartite distance hereditary graphs. Art Discret. Appl. Math. 5(1) (2022) - [j59]Massimiliano Caramia:
"Algorithms in Multi-Objective Optimization": Foreword by the Guest Editor. Algorithms 15(12): 476 (2022) - [j58]Massimiliano Caramia, Emanuele Pizzari:
Clustering, location, and allocation in two stage supply chain for waste management: A fractional programming approach. Comput. Ind. Eng. 169: 108297 (2022) - [j57]Massimiliano Caramia, Giuseppe Stecca:
Sustainable two stage supply chain management: A quadratic optimization approach with a quadratic constraint. EURO J. Comput. Optim. 10: 100040 (2022) - [j56]Lucio Bianco, Massimiliano Caramia, Stefano Giordani:
Project scheduling with generalized precedence relations: A new method to analyze criticalities and flexibilities. Eur. J. Oper. Res. 298(2): 451-462 (2022) - 2021
- [j55]Massimiliano Caramia:
Maximizing recyclable materials and user utility in waste collection: a linear-quadratic bilevel optimization approach. Optim. Lett. 15(6): 1885-1904 (2021) - 2020
- [j54]Massimiliano Caramia:
Project management and scheduling. Ann. Oper. Res. 285(1): 1-8 (2020) - [j53]Massimiliano Caramia, Mattia Dalla Costa:
An application of bilevel optimisation to the waste collection centres location problem. Int. J. Math. Oper. Res. 16(1): 118-137 (2020) - [j52]Massimiliano Caramia, Stefano Giordani:
Location of differentiated waste collection centers with user cooperation: a bilevel optimization approach. Optim. Lett. 14(1): 85-99 (2020) - [j51]Massimiliano Caramia, Stefano Giordani:
Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study. Oper. Res. Forum 1(2) (2020)
2010 – 2019
- 2019
- [j50]Lucio Bianco, Massimiliano Caramia, Stefano Giordani:
A chance constrained optimization approach for resource unconstrained project scheduling with uncertainty in activity execution intensity. Comput. Ind. Eng. 128: 831-836 (2019) - [j49]Massimiliano Caramia:
Project management. Comput. Ind. Eng. 136: 1-4 (2019) - 2017
- [j48]Lucio Bianco, Massimiliano Caramia:
The Resource Constrained Project Scheduling Problem: A theoretical comparison between a recent formulation and the main time indexed linear programming based approaches. RAIRO Oper. Res. 51(3): 519-532 (2017) - 2016
- [j47]Massimiliano Caramia, Renato Mari:
A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints. Optim. Lett. 10(5): 997-1019 (2016) - [j46]Lucio Bianco, Massimiliano Caramia, Stefano Giordani:
Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities. OR Spectr. 38(2): 405-425 (2016) - [j45]Lucio Bianco, Massimiliano Caramia, Stefano Giordani, Veronica Piccialli:
A Game-Theoretic Approach for Regulating Hazmat Transportation. Transp. Sci. 50(2): 424-438 (2016) - 2015
- [j44]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa:
On the Galois lattice of bipartite distance hereditary graphs. Discret. Appl. Math. 190-191: 13-23 (2015) - [j43]Massimiliano Caramia, Renato Mari:
On the choice of the penalty parameter for discrete-continuous linear bi-level problems reformulation. Int. J. Math. Oper. Res. 7(1): 103-118 (2015) - [j42]Massimiliano Caramia, Renato Mari:
Enhanced exact algorithms for discrete bilevel linear problems. Optim. Lett. 9(7): 1447-1468 (2015) - [i2]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa, Jean-François Mascari:
A tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs. CoRR abs/1511.03100 (2015) - 2014
- [c10]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa:
On the Galois Lattice of Bipartite Distance Hereditary Graphs. IWOCA 2014: 37-48 - [i1]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa:
On the Galois Lattice of Bipartite Distance Hereditary Graphs. CoRR abs/1406.0154 (2014) - 2013
- [j41]Nicola Apollonio, Massimiliano Caramia:
Mengerian quasi-graphical families and clutters. Eur. J. Comb. 34(3): 647-659 (2013) - [j40]Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano:
On a facility location problem with applications to tele-diagnostic. Optim. Lett. 7(6): 1179-1192 (2013) - 2012
- [j39]Lucio Bianco, Massimiliano Caramia:
Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm. 4OR 10(4): 361-377 (2012) - [j38]Lucio Bianco, Massimiliano Caramia:
An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations. Eur. J. Oper. Res. 219(1): 73-85 (2012) - 2011
- [j37]Lucio Bianco, Massimiliano Caramia:
Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound. 4OR 9(4): 371-389 (2011) - [j36]Lucio Bianco, Massimiliano Caramia:
A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations. Comput. Oper. Res. 38(1): 14-20 (2011) - [j35]Nicola Apollonio, Massimiliano Caramia:
Recognizing Helly Edge-Path-Tree graphs and their clique graphs. Discret. Appl. Math. 159(11): 1166-1175 (2011) - [j34]Massimiliano Caramia, Francesca Guerriero:
A note on the modelling of project networks with time constraints. Eur. J. Oper. Res. 211(3): 666-670 (2011) - [j33]Massimiliano Caramia, Stefano Giordani:
An Economic Model for Resource Allocation in Grid Computing. Oper. Res. 59(4): 956-972 (2011) - 2010
- [j32]Massimiliano Caramia, Ciro D'Apice, Benedetto Piccoli, Antonino Sgalambro:
Fluidsim: A Car Traffic Simulation Prototype Based on FluidDynamic. Algorithms 3(3): 294-310 (2010) - [j31]Massimiliano Caramia, Stefano Giordani:
A fast metaheuristic for scheduling independent tasks with multiple modes. Comput. Ind. Eng. 58(1): 64-69 (2010) - [j30]Nicola Apollonio, Massimiliano Caramia:
On the maximum q-colourable induced subgraph problem in perfect graphs. Int. J. Math. Oper. Res. 2(1): 1-16 (2010) - [j29]Massimiliano Caramia, Stefano Giordani:
An asymptotic worst case analysis of the effectiveness of the Harmonic 3D-shelf algorithm for online 3D-strip packing. Int. J. Math. Oper. Res. 2(3): 336-346 (2010) - [j28]Massimiliano Caramia, Francesca Guerriero:
A Milk Collection Problem with Incompatibility Constraints. Interfaces 40(2): 130-143 (2010) - [j27]Massimiliano Caramia, Francesca Guerriero:
A heuristic approach for the truck and trailer routing problem. J. Oper. Res. Soc. 61(7): 1168-1180 (2010) - [j26]Lucio Bianco, Massimiliano Caramia:
A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time. Networks 56(4): 263-271 (2010) - [j25]Massimiliano Caramia, Antonino Sgalambro:
A fast heuristic algorithm for the maximum concurrent k-splittable flow problem. Optim. Lett. 4(1): 37-55 (2010)
2000 – 2009
- 2009
- [j24]Massimiliano Caramia, Stefano Giordani:
A new approach for scheduling independent tasks with multiple modes. J. Heuristics 15(4): 313-329 (2009) - [j23]Massimiliano Caramia, Stefano Giordani:
On the selection of k efficient paths by clustering techniques. Int. J. Data Min. Model. Manag. 1(3): 237-260 (2009) - [j22]Nicola Apollonio, Massimiliano Caramia:
A superclass of Edge-Path-Tree graphs with few cliques. Oper. Res. Lett. 37(5): 351-355 (2009) - [c9]Lucio Bianco, Massimiliano Caramia:
An Exact Algorithm to Minimize the Makespan in Project Scheduling with Scarce Resources and Feeding Precedence Relations. CTW 2009: 210-214 - [c8]Lucio Bianco, Massimiliano Caramia:
Advanced Topics in Project Management Process. APMS 2009: 425-432 - [c7]Nicola Apollonio, Massimiliano Caramia:
Integrality Properties of Certain Special Balanceable Families. IWOCA 2009: 48-59 - [r1]Massimiliano Caramia, Giovanni Felici:
Web Mining in Thematic Search Engines. Encyclopedia of Data Warehousing and Mining 2009: 2080-2084 - 2008
- [j21]Massimiliano Caramia, Paolo Dell'Olmo:
Coloring graphs by iterated local search traversing feasible and infeasible solutions. Discret. Appl. Math. 156(2): 201-217 (2008) - [j20]Massimiliano Caramia, Stefano Giordani:
On the effectiveness of the Harmonic Shelf Algorithm for on-line strip packing. Discret. Math. 308(16): 3699-3703 (2008) - [j19]Massimiliano Caramia, Paolo Dell'Olmo:
Embedding a novel objective function in a two-phased local search for robust vertex coloring. Eur. J. Oper. Res. 189(3): 1358-1380 (2008) - [j18]Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
Novel Local-Search-Based Approaches to University Examination Timetabling. INFORMS J. Comput. 20(1): 86-99 (2008) - [j17]Massimiliano Caramia, Antonino Sgalambro:
On the approximation of the single source k-splittable flow problem. J. Discrete Algorithms 6(2): 277-289 (2008) - [j16]Massimiliano Caramia, Antonino Sgalambro:
An exact approach for the maximum concurrent k -splittable flow problem. Optim. Lett. 2(2): 251-265 (2008) - 2007
- [j15]Massimiliano Caramia, Paolo Dell'Olmo, Monica Gentili, Pitu B. Mirchandani:
Delivery itineraries and distribution capacity of a freight network with time slots. Comput. Oper. Res. 34(6): 1585-1600 (2007) - [j14]Massimiliano Caramia, Paolo Dell'Olmo:
Coupling Stochastic and Deterministic Local Search in Examination Timetabling. Oper. Res. 55(2): 351-366 (2007) - 2006
- [j13]Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
CHECKCOL: Improved local search for graph coloring. J. Discrete Algorithms 4(2): 277-298 (2006) - [j12]Massimiliano Caramia, Giovanni Storchi:
Evaluating the effects of parking price and location in multi-modal transportation networks. Networks Heterog. Media 1(3): 441-465 (2006) - 2005
- [j11]Massimiliano Caramia, Paolo Dell'Olmo, Antonio Iovanella:
Lower bound algorithms for multiprocessor task scheduling with ready times. Int. Trans. Oper. Res. 12(5): 481-508 (2005) - [j10]Piero Barone, Massimiliano Caramia:
A Fast Automatic Algorithm for Image Denoising by a Regularization Method. SIAM J. Optim. 15(2): 573-592 (2005) - 2004
- [j9]Massimiliano Caramia, Giovanni Felici, A. Pezzoli:
Improving search results with data mining in a thematic search engine. Comput. Oper. Res. 31(14): 2387-2404 (2004) - [j8]Massimiliano Caramia, Jirí Fiala:
New lower bounds on the weighted chromatic number of a graph. Discuss. Math. Graph Theory 24(2): 183-195 (2004) - [j7]Massimiliano Caramia, Stefano Giordani, Antonio Iovanella:
Grid scheduling by on-line rectangle packing. Networks 44(2): 106-119 (2004) - [j6]Massimiliano Caramia, Paolo Dell'Olmo:
Bounding vertex coloring by truncated multistage branch and bound. Networks 44(4): 231-242 (2004) - [c6]Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano:
A Stochastic Location Problem with Applications to Tele-diagnostic. WG 2004: 201-213 - 2003
- [j5]Massimiliano Caramia, Stefano Giordani:
A new graph model and heuristic algorithm for multi-mode task scheduling problem. Electron. Notes Discret. Math. 13: 30-33 (2003) - [j4]Massimiliano Caramia, Paolo Dell'Olmo:
Assessing the resource usage in scheduling with incompatibilities. OR Spectr. 25(4): 521-547 (2003) - [c5]Massimiliano Caramia, Stefano Giordani, Antonio Iovanella:
An On-Line Algorithm for the Rectangle Packing Problem with Rejection. WEA 2003: 59-69 - 2002
- [j3]Massimiliano Caramia, Paolo Dell'Olmo:
Constraint Propagation in Graph Coloring. J. Heuristics 8(1): 83-107 (2002) - [c4]Massimiliano Caramia, Pasquale Carotenuto, Stefano Giordani, Antonio Iovanella:
Using Rejection Methods in a DSS for Production Strategies. BASYS 2002: 419-426 - [c3]Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella:
Scheduling of Independent Dedicated Multiprocessor Tasks. ISAAC 2002: 391-402 - 2001
- [j2]Massimiliano Caramia, Paolo Dell'Olmo:
A lower bound on the chromatic number of Mycielski graphs. Discret. Math. 235(1-3): 79-86 (2001) - [j1]Massimiliano Caramia, Paolo Dell'Olmo:
Solving the minimum-weighted coloring problem. Networks 38(2): 88-101 (2001) - 2000
- [c2]Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
New Algorithms for Examination Timetabling. WAE 2000: 230-242
1990 – 1999
- 1999
- [c1]Massimiliano Caramia, Paolo Dell'Olmo:
A Fast and Simple Local Search for Graph Coloring. WAE 1999: 317-330
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-11-07 20:32 CET 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:
