Massimiliano Caramia
Orcid: 0000-0002-9925-1306
According to our database1,
Massimiliano Caramia
authored at least 72 papers
between 1999 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2023
EURO J. Transp. Logist., 2023
"Multi-Objective and Multi-Level Optimization: Algorithms and Applications": Foreword by the Guest Editor.
Algorithms, 2023
2022
Project scheduling with generalized precedence relations: A new method to analyze criticalities and flexibilities.
Eur. J. Oper. Res., 2022
Sustainable two stage supply chain management: A quadratic optimization approach with a quadratic constraint.
EURO J. Comput. Optim., 2022
Clustering, location, and allocation in two stage supply chain for waste management: A fractional programming approach.
Comput. Ind. Eng., 2022
Algorithms, 2022
A tight relation between series-parallel graphs and bipartite distance hereditary graphs.
Art Discret. Appl. Math., 2022
2021
Maximizing recyclable materials and user utility in waste collection: a linear-quadratic bilevel optimization approach.
Optim. Lett., 2021
2020
Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study.
Oper. Res. Forum, 2020
Location of differentiated waste collection centers with user cooperation: a bilevel optimization approach.
Optim. Lett., 2020
An application of bilevel optimisation to the waste collection centres location problem.
Int. J. Math. Oper. Res., 2020
2019
A chance constrained optimization approach for resource unconstrained project scheduling with uncertainty in activity execution intensity.
Comput. Ind. Eng., 2019
2017
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., 2017
2016
Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities.
OR Spectr., 2016
A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints.
Optim. Lett., 2016
2015
On the choice of the penalty parameter for discrete-continuous linear bi-level problems reformulation.
Int. J. Math. Oper. Res., 2015
Discret. Appl. Math., 2015
2013
Optim. Lett., 2013
2012
An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations.
Eur. J. Oper. Res., 2012
Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm.
4OR, 2012
2011
Eur. J. Oper. Res., 2011
Discret. Appl. Math., 2011
A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations.
Comput. Oper. Res., 2011
Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound.
4OR, 2011
2010
A fast heuristic algorithm for the maximum concurrent <i>k</i>-splittable flow problem.
Optim. Lett., 2010
A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time.
Networks, 2010
J. Oper. Res. Soc., 2010
An asymptotic worst case analysis of the effectiveness of the Harmonic 3D-shelf algorithm for online 3D-strip packing.
Int. J. Math. Oper. Res., 2010
Int. J. Math. Oper. Res., 2010
Comput. Ind. Eng., 2010
2009
Proceedings of the Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), 2009
Int. J. Data Min. Model. Manag., 2009
J. Heuristics, 2009
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009
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
2008
Optim. Lett., 2008
J. Discrete Algorithms, 2008
INFORMS J. Comput., 2008
Embedding a novel objective function in a two-phased local search for robust vertex coloring.
Eur. J. Oper. Res., 2008
Discret. Math., 2008
Coloring graphs by iterated local search traversing feasible and infeasible solutions.
Discret. Appl. Math., 2008
2007
Oper. Res., 2007
Comput. Oper. Res., 2007
2006
Evaluating the effects of parking price and location in multi-modal transportation networks.
Networks Heterog. Media, 2006
2005
SIAM J. Optim., 2005
Int. Trans. Oper. Res., 2005
2004
Networks, 2004
Discuss. Math. Graph Theory, 2004
Comput. Oper. Res., 2004
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
2003
Electron. Notes Discret. Math., 2003
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003
2002
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
2001
2000
Proceedings of the Algorithm Engineering, 2000
1999
Proceedings of the Algorithm Engineering, 1999