Massimiliano Caramia

According to our database1, Massimiliano Caramia authored at least 63 papers between 1999 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 





Project management.
Computers & Industrial Engineering, 2019

A chance constrained optimization approach for resource unconstrained project scheduling with uncertainty in activity execution intensity.
Computers & Industrial Engineering, 2019

The Resource Constrained Project Scheduling Problem: A theoretical comparison between a recent formulation and the main time indexed linear programming based approaches.
RAIRO - Operations Research, 2017

A Game-Theoretic Approach for Regulating Hazmat Transportation.
Transportation Science, 2016

Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities.
OR Spectrum, 2016

A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints.
Optimization Letters, 2016

Enhanced exact algorithms for discrete bilevel linear problems.
Optimization Letters, 2015

On the choice of the penalty parameter for discrete-continuous linear bi-level problems reformulation.
IJMOR, 2015

On the Galois lattice of bipartite distance hereditary graphs.
Discrete Applied Mathematics, 2015

A tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs.
CoRR, 2015

On the Galois Lattice of Bipartite Distance Hereditary Graphs.
CoRR, 2014

On the Galois Lattice of Bipartite Distance Hereditary Graphs.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

On a facility location problem with applications to tele-diagnostic.
Optimization Letters, 2013

Mengerian quasi-graphical families and clutters.
Eur. J. Comb., 2013

An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations.
European Journal of Operational Research, 2012

Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm.
4OR, 2012

An Economic Model for Resource Allocation in Grid Computing.
Operations Research, 2011

A note on the modelling of project networks with time constraints.
European Journal of Operational Research, 2011

Recognizing Helly Edge-Path-Tree graphs and their clique graphs.
Discrete Applied Mathematics, 2011

A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations.
Computers & OR, 2011

Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound.
4OR, 2011

A fast heuristic algorithm for the maximum concurrent k-splittable flow problem.
Optimization Letters, 2010

A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time.
Networks, 2010

A heuristic approach for the truck and trailer routing problem.
JORS, 2010

A Milk Collection Problem with Incompatibility Constraints.
Interfaces, 2010

An asymptotic worst case analysis of the effectiveness of the Harmonic 3D-shelf algorithm for online 3D-strip packing.
IJMOR, 2010

On the maximum q-colourable induced subgraph problem in perfect graphs.
IJMOR, 2010

A fast metaheuristic for scheduling independent tasks with multiple modes.
Computers & Industrial Engineering, 2010

Fluidsim: A Car Traffic Simulation Prototype Based on FluidDynamic.
Algorithms, 2010

Web Mining in Thematic Search Engines.
Proceedings of the Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), 2009

A superclass of Edge-Path-Tree graphs with few cliques.
Oper. Res. Lett., 2009

On the selection of k efficient paths by clustering techniques.
IJDMMM, 2009

A new approach for scheduling independent tasks with multiple modes.
J. Heuristics, 2009

Integrality Properties of Certain Special Balanceable Families.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Advanced Topics in Project Management Process.
Proceedings of the Advances in Production Management Systems. New Challenges, New Approaches, 2009

An Exact Algorithm to Minimize the Makespan in Project Scheduling with Scarce Resources and Feeding Precedence Relations.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

An exact approach for the maximum concurrent k -splittable flow problem.
Optimization Letters, 2008

On the approximation of the single source k-splittable flow problem.
J. Discrete Algorithms, 2008

Novel Local-Search-Based Approaches to University Examination Timetabling.
INFORMS Journal on Computing, 2008

Embedding a novel objective function in a two-phased local search for robust vertex coloring.
European Journal of Operational Research, 2008

On the effectiveness of the Harmonic Shelf Algorithm for on-line strip packing.
Discrete Mathematics, 2008

Coloring graphs by iterated local search traversing feasible and infeasible solutions.
Discrete Applied Mathematics, 2008

Coupling Stochastic and Deterministic Local Search in Examination Timetabling.
Operations Research, 2007

Delivery itineraries and distribution capacity of a freight network with time slots.
Computers & OR, 2007

Evaluating the effects of parking price and location in multi-modal transportation networks.
NHM, 2006

CHECKCOL: Improved local search for graph coloring.
J. Discrete Algorithms, 2006

A Fast Automatic Algorithm for Image Denoising by a Regularization Method.
SIAM Journal on Optimization, 2005

Lower bound algorithms for multiprocessor task scheduling with ready times.
ITOR, 2005

Grid scheduling by on-line rectangle packing.
Networks, 2004

Bounding vertex coloring by truncated multistage branch and bound.
Networks, 2004

New lower bounds on the weighted chromatic number of a graph.
Discussiones Mathematicae Graph Theory, 2004

Improving search results with data mining in a thematic search engine.
Computers & OR, 2004

A Stochastic Location Problem with Applications to Tele-diagnostic.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Assessing the resource usage in scheduling with incompatibilities.
OR Spectrum, 2003

A new graph model and heuristic algorithm for multi-mode task scheduling problem.
Electronic Notes in Discrete Mathematics, 2003

An On-Line Algorithm for the Rectangle Packing Problem with Rejection.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Constraint Propagation in Graph Coloring.
J. Heuristics, 2002

Scheduling of Independent Dedicated Multiprocessor Tasks.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Using Rejection Methods in a DSS for Production Strategies.
Proceedings of the Knowledge and Technology Integration in Production and Services: Balancing Knowledge in Product and Service Life Cycle, 2002

Solving the minimum-weighted coloring problem.
Networks, 2001

A lower bound on the chromatic number of Mycielski graphs.
Discrete Mathematics, 2001

New Algorithms for Examination Timetabling.
Proceedings of the Algorithm Engineering, 2000

A Fast and Simple Local Search for Graph Coloring.
Proceedings of the Algorithm Engineering, 1999