Get started
Author

Marco Caserta

Observed names: Caserta, Marco, M Caserta, M. Caserta, Marco. Caserta (7998995)
ORCID: 0000-0003-3844-6561
Observed ORCID: 0000-0003-3844-6561
OpenAlex ID: A5042175684
A mathematical formulation and complexity considerations for the blocks relocation problem
2011 · Marco Caserta, Silvia Schwarze, et al. · European Journal of Operational Research · 257
Applying the corridor method to a blocks relocation problem
2009 · Marco Caserta, Stefan Voß, et al. · OR Spectrum · 225
Container Rehandling at Maritime Container Terminals
2011 · Marco Caserta, Silvia Schwarze, et al. · Operations research, computer science. Interface series · 102
An improved mathematical formulation for the blocks relocation problem
2015 · Elisabeth Zehendner, Marco Caserta, et al. · European Journal of Operational Research · 80
A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic
2009 · Marco Caserta, Silvia Schwarze, et al. · Lecture notes in computer science · 80
Metaheuristics: Intelligent Problem Solving
2009 · Marco Caserta, Stefan Voß · Annals of information systems · 78
A Corridor Method-Based Algorithm for the Pre-marshalling Problem
2009 · Marco Caserta, Stefan Voß · Lecture notes in computer science · 76
An exact algorithm for the reliability redundancy allocation problem
2015 · Marco Caserta, Stefan Voß · European Journal of Operational Research · 71
A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
2007 · M. Caserta, E. Quiñonez Rico · Computers & Operations Research · 57
Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems
2007 · Marco Caserta · Springer eBooks · 57
Tuning metaheuristics: A data mining based approach for particle swarm optimization
2011 · Stefan Lessmann, Marco Caserta, et al. · Expert Systems with Applications · 55
Corridor Selection and Fine Tuning for the Corridor Method
2009 · Marco Caserta, Stefan Voß · Lecture notes in computer science · 37
The robust multiple-choice multidimensional knapsack problem
2018 · Marco Caserta, Stefan Voß · Omega · 34
A hybrid algorithm for the DNA sequencing problem
2012 · Marco Caserta, Stefan Voß · Discrete Applied Mathematics · 31
A cross entropy algorithm for the Knapsack problem with setups
2006 · M. Caserta, E. Quiñonez Rico, et al. · Computers & Operations Research · 31
A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems
2008 · M Caserta, E Quiñonez Rico · Journal of the Operational Research Society · 26
A cross entropy based algorithm for reliability problems
2008 · Marco Caserta, Marta Cabo Nodar · Journal of Heuristics · 26
A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning
2015 · Marco Caserta, Torsten Reiners · European Journal of Operational Research · 24
Container Rehandling at Maritime Container Terminals: A Literature Update
2020 · Marco Caserta, Silvia Schwarze, et al. · Operations research, computer science. Interface series · 22
A Cooperative Strategy for Guiding the Corridor Method
2009 · Marco Caserta, Stefan Voß · Studies in computational intelligence · 19
Intermittent demand forecasting for spare parts with little historical information
2024 · Marco Caserta, Luca D’Angelo · Journal of the Operational Research Society · 18
A Math-Heuristic for the Multi-Level Capacitated Lot Sizing Problem with Carryover
2010 · Marco Caserta, Adriana Ramirez, et al. · Lecture notes in computer science · 18
A corridor method based hybrid algorithm for redundancy allocation
2014 · Marco Caserta, Stefan Voß · Journal of Heuristics · 16
A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
2013 · Marco Caserta, Stefan Voß · Annals of Mathematics and Artificial Intelligence · 16
A general corridor method-based approach for capacitated facility location
2019 · Marco Caserta, Stefan Voß · International Journal of Production Research · 15
Works count: 55
Citation count: 1,592
H-index: 19
I10-index: 29
Year
Topic
Type