Massimiliano Caramia

80 papers B 2C 3Journal 69Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Life-Cycle Technology Upgrade Scheduling Model.
Algorithms
Massimiliano Caramia
2024 J jnl
An Improved Negotiation-Based Approach for Collecting and Sorting Operations in Waste Management and Recycling.
Algorithms
Massimiliano Caramia, Giuseppe Stecca
2024 J jnl
Novel bilevel formulations for waste management.
Discret. Appl. Math.
Massimiliano Caramia, Emanuele Pizzari
2024 J jnl
On the concept of criticality on GPRs project network with variable activity durations.
Comput. Ind. Eng.
Lucio Bianco, Massimiliano Caramia, Stefano Giordani, Alessio Salvatore
2024 J jnl
Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm.
Ann. Oper. Res.
Lucio Bianco, Massimiliano Caramia, Stefano Giordani, Alessio Salvatore
2023 J jnl
"Multi-Objective and Multi-Level Optimization: Algorithms and Applications": Foreword by the Guest Editor.
Algorithms
Massimiliano Caramia
2023 J jnl
Clustering and routing in waste management: A two-stage optimisation approach.
EURO J. Transp. Logist.
Massimiliano Caramia, Diego Maria Pinto, Emanuele Pizzari, Giuseppe Stecca
2022 J jnl
"Algorithms in Multi-Objective Optimization": Foreword by the Guest Editor.
Algorithms
Massimiliano Caramia
2022 J jnl
A tight relation between series-parallel graphs and bipartite distance hereditary graphs.
Art Discret. Appl. Math.
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa, Jean-François Mascari
2022 J jnl
Clustering, location, and allocation in two stage supply chain for waste management: A fractional programming approach.
Comput. Ind. Eng.
Massimiliano Caramia, Emanuele Pizzari
2022 J jnl
Project scheduling with generalized precedence relations: A new method to analyze criticalities and flexibilities.
Eur. J. Oper. Res.
Lucio Bianco, Massimiliano Caramia, Stefano Giordani
2022 J jnl
Sustainable two stage supply chain management: A quadratic optimization approach with a quadratic constraint.
EURO J. Comput. Optim.
Massimiliano Caramia, Giuseppe Stecca
2021 J jnl
Maximizing recyclable materials and user utility in waste collection: a linear-quadratic bilevel optimization approach.
Optim. Lett.
Massimiliano Caramia
2020 J jnl
An application of bilevel optimisation to the waste collection centres location problem.
Int. J. Math. Oper. Res.
Massimiliano Caramia, Mattia Dalla Costa
2020 J jnl
Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study.
Oper. Res. Forum
Massimiliano Caramia, Stefano Giordani
2020 J jnl
Location of differentiated waste collection centers with user cooperation: a bilevel optimization approach.
Optim. Lett.
Massimiliano Caramia, Stefano Giordani
2020 J jnl
Project management and scheduling.
Ann. Oper. Res.
Massimiliano Caramia
2019 J jnl
A chance constrained optimization approach for resource unconstrained project scheduling with uncertainty in activity execution intensity.
Comput. Ind. Eng.
Lucio Bianco, Massimiliano Caramia, Stefano Giordani
2019 J jnl
Project management.
Comput. Ind. Eng.
Massimiliano Caramia
2017 J jnl
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.
Lucio Bianco, Massimiliano Caramia
2016 J jnl
A Game-Theoretic Approach for Regulating Hazmat Transportation.
Transp. Sci.
Lucio Bianco, Massimiliano Caramia, Stefano Giordani, Veronica Piccialli
2016 J jnl
A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints.
Optim. Lett.
Massimiliano Caramia, Renato Mari
2016 J jnl
Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities.
OR Spectr.
Lucio Bianco, Massimiliano Caramia, Stefano Giordani
2015 J jnl
A tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs.
CoRR
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa, Jean-François Mascari
2015 J jnl
Enhanced exact algorithms for discrete bilevel linear problems.
Optim. Lett.
Massimiliano Caramia, Renato Mari
2015 J jnl
On the Galois lattice of bipartite distance hereditary graphs.
Discret. Appl. Math.
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
2015 J jnl
On the choice of the penalty parameter for discrete-continuous linear bi-level problems reformulation.
Int. J. Math. Oper. Res.
Massimiliano Caramia, Renato Mari
2014 C conf
On the Galois Lattice of Bipartite Distance Hereditary Graphs.
IWOCA
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
2014 J jnl
On the Galois Lattice of Bipartite Distance Hereditary Graphs.
CoRR
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
2013 J jnl
Mengerian quasi-graphical families and clutters.
Eur. J. Comb.
Nicola Apollonio, Massimiliano Caramia
2013 J jnl
On a facility location problem with applications to tele-diagnostic.
Optim. Lett.
Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano
2012 J jnl
An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations.
Eur. J. Oper. Res.
Lucio Bianco, Massimiliano Caramia
2012 J jnl
Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm.
4OR
Lucio Bianco, Massimiliano Caramia
2011 J jnl
A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations.
Comput. Oper. Res.
Lucio Bianco, Massimiliano Caramia
2011 J jnl
A note on the modelling of project networks with time constraints.
Eur. J. Oper. Res.
Massimiliano Caramia, Francesca Guerriero
2011 J jnl
An Economic Model for Resource Allocation in Grid Computing.
Oper. Res.
Massimiliano Caramia, Stefano Giordani
2011 J jnl
Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound.
4OR
Lucio Bianco, Massimiliano Caramia
2011 J jnl
Recognizing Helly Edge-Path-Tree graphs and their clique graphs.
Discret. Appl. Math.
Nicola Apollonio, Massimiliano Caramia
2010 J jnl
A Milk Collection Problem with Incompatibility Constraints.
Interfaces
Massimiliano Caramia, Francesca Guerriero
2010 J jnl
A fast heuristic algorithm for the maximum concurrent
Optim. Lett.
Massimiliano Caramia, Antonino Sgalambro
2010 J jnl
A fast metaheuristic for scheduling independent tasks with multiple modes.
Comput. Ind. Eng.
Massimiliano Caramia, Stefano Giordani
2010 J jnl
A heuristic approach for the truck and trailer routing problem.
J. Oper. Res. Soc.
Massimiliano Caramia, Francesca Guerriero
2010 J jnl
A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time.
Networks
Lucio Bianco, Massimiliano Caramia
2010 J jnl
An asymptotic worst case analysis of the effectiveness of the Harmonic 3D-shelf algorithm for online 3D-strip packing.
Int. J. Math. Oper. Res.
Massimiliano Caramia, Stefano Giordani
2010 J jnl
Fluidsim: A Car Traffic Simulation Prototype Based on FluidDynamic.
Algorithms
Massimiliano Caramia, Ciro D'Apice, Benedetto Piccoli, Antonino Sgalambro
2010 J jnl
On the maximum q-colourable induced subgraph problem in perfect graphs.
Int. J. Math. Oper. Res.
Nicola Apollonio, Massimiliano Caramia
2009 J jnl
A new approach for scheduling independent tasks with multiple modes.
J. Heuristics
Massimiliano Caramia, Stefano Giordani
2009 J jnl
A superclass of Edge-Path-Tree graphs with few cliques.
Oper. Res. Lett.
Nicola Apollonio, Massimiliano Caramia
2009 — conf
Advanced Topics in Project Management Process.
APMS
Lucio Bianco, Massimiliano Caramia
2009 C conf
An Exact Algorithm to Minimize the Makespan in Project Scheduling with Scarce Resources and Feeding Precedence Relations.
CTW
Lucio Bianco, Massimiliano Caramia
2009 C conf
Integrality Properties of Certain Special Balanceable Families.
IWOCA
Nicola Apollonio, Massimiliano Caramia
2009 J jnl
On the selection of k efficient paths by clustering techniques.
Int. J. Data Min. Model. Manag.
Massimiliano Caramia, Stefano Giordani
2009 — ch.
Web Mining in Thematic Search Engines.
Encyclopedia of Data Warehousing and Mining
Massimiliano Caramia, Giovanni Felici
2008 J jnl
An exact approach for the maximum concurrent
Optim. Lett.
Massimiliano Caramia, Antonino Sgalambro
2008 J jnl
Coloring graphs by iterated local search traversing feasible and infeasible solutions.
Discret. Appl. Math.
Massimiliano Caramia, Paolo Dell'Olmo
2008 J jnl
Embedding a novel objective function in a two-phased local search for robust vertex coloring.
Eur. J. Oper. Res.
Massimiliano Caramia, Paolo Dell'Olmo
2008 J jnl
Novel Local-Search-Based Approaches to University Examination Timetabling.
INFORMS J. Comput.
Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano
2008 J jnl
On the approximation of the single source k-splittable flow problem.
J. Discrete Algorithms
Massimiliano Caramia, Antonino Sgalambro
2008 J jnl
On the effectiveness of the Harmonic Shelf Algorithm for on-line strip packing.
Discret. Math.
Massimiliano Caramia, Stefano Giordani
2007 J jnl
Coupling Stochastic and Deterministic Local Search in Examination Timetabling.
Oper. Res.
Massimiliano Caramia, Paolo Dell'Olmo
2007 J jnl
Delivery itineraries and distribution capacity of a freight network with time slots.
Comput. Oper. Res.
Massimiliano Caramia, Paolo Dell'Olmo, Monica Gentili, Pitu B. Mirchandani
2006 J jnl
CHECKCOL: Improved local search for graph coloring.
J. Discrete Algorithms
Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano
2006 J jnl
Evaluating the effects of parking price and location in multi-modal transportation networks.
Networks Heterog. Media
Massimiliano Caramia, Giovanni Storchi
2005 J jnl
A Fast Automatic Algorithm for Image Denoising by a Regularization Method.
SIAM J. Optim.
Piero Barone, Massimiliano Caramia
2005 J jnl
Lower bound algorithms for multiprocessor task scheduling with ready times.
Int. Trans. Oper. Res.
Massimiliano Caramia, Paolo Dell'Olmo, Antonio Iovanella
2004 B conf
A Stochastic Location Problem with Applications to Tele-diagnostic.
WG
Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano
2004 J jnl
Bounding vertex coloring by truncated
Networks
Massimiliano Caramia, Paolo Dell'Olmo
2004 J jnl
Grid scheduling by on-line rectangle packing.
Networks
Massimiliano Caramia, Stefano Giordani, Antonio Iovanella
2004 J jnl
Improving search results with data mining in a thematic search engine.
Comput. Oper. Res.
Massimiliano Caramia, Giovanni Felici, A. Pezzoli
2004 J jnl
New lower bounds on the weighted chromatic number of a graph.
Discuss. Math. Graph Theory
Massimiliano Caramia, Jirí Fiala
2003 J jnl
A new graph model and heuristic algorithm for multi-mode task scheduling problem.
Electron. Notes Discret. Math.
Massimiliano Caramia, Stefano Giordani
2003 — conf
An On-Line Algorithm for the Rectangle Packing Problem with Rejection.
WEA
Massimiliano Caramia, Stefano Giordani, Antonio Iovanella
2003 J jnl
Assessing the resource usage in scheduling with incompatibilities.
OR Spectr.
Massimiliano Caramia, Paolo Dell'Olmo
2002 J jnl
Constraint Propagation in Graph Coloring.
J. Heuristics
Massimiliano Caramia, Paolo Dell'Olmo
2002 B conf
Scheduling of Independent Dedicated Multiprocessor Tasks.
ISAAC
Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella
2002 — conf
Using Rejection Methods in a DSS for Production Strategies.
BASYS
Massimiliano Caramia, Pasquale Carotenuto, Stefano Giordani, Antonio Iovanella
2001 J jnl
A lower bound on the chromatic number of Mycielski graphs.
Discret. Math.
Massimiliano Caramia, Paolo Dell'Olmo
2001 J jnl
Solving the minimum-weighted coloring problem.
Networks
Massimiliano Caramia, Paolo Dell'Olmo
2000 — conf
New Algorithms for Examination Timetabling.
WAE
Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano
1999 — conf
A Fast and Simple Local Search for Graph Coloring.
WAE
Massimiliano Caramia, Paolo Dell'Olmo