default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Caserta
Person information
- affiliation: IE Business School, Madrid, Spain
- affiliation (former): University of Hamburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Benedikt Schesch, Marco Caserta:
Large Scale Constrained Clustering With Reinforcement Learning. CoRR abs/2402.10177 (2024)- 2022
- [j19]Roberto Baldacci
, Marco Caserta, Emiliano Traversi, Roberto Wolfler Calvo:
Robustness of solutions to the capacitated facility location problem with uncertain demand. Optim. Lett. 16(9): 2711-2727 (2022) - 2021
- [j18]Marco Caserta, Stefan Voß:
Accelerating mathematical programming techniques with the corridor method. Int. J. Prod. Res. 59(9): 2739-2771 (2021) - [j17]Marco Caserta, Stefan Voß:
A note on: "A hybrid Benders approach for coordinated capacitated lot-sizing of multiple product families with set-up times, " by T. Bayley, H. Süral, and J. Bookbinder. Int. J. Prod. Res. 59(14): 4453-4456 (2021) - 2020
- [j16]Marco Caserta, Stefan Voß:
A general corridor method-based approach for capacitated facility location. Int. J. Prod. Res. 58(13): 3855-3880 (2020)
2010 – 2019
- 2016
- [j15]Marco Caserta, Torsten Reiners:
A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning. Eur. J. Oper. Res. 248(2): 593-606 (2016) - [j14]Marco Caserta, Stefan Voß:
A corridor method based hybrid algorithm for redundancy allocation. J. Heuristics 22(4): 405-429 (2016) - 2015
- [j13]Marco Caserta, Stefan Voß:
An exact algorithm for the reliability redundancy allocation problem. Eur. J. Oper. Res. 244(1): 110-116 (2015) - [j12]Elisabeth Zehendner, Marco Caserta, Dominique Feillet, Silvia Schwarze, Stefan Voß:
An improved mathematical formulation for the blocks relocation problem. Eur. J. Oper. Res. 245(2): 415-422 (2015) - 2014
- [j11]Marco Caserta, Stefan Voß:
A hybrid algorithm for the DNA sequencing problem. Discret. Appl. Math. 163: 87-99 (2014) - 2013
- [j10]Marco Caserta, Stefan Voß:
A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing. Ann. Math. Artif. Intell. 69(2): 207-224 (2013) - [j9]Marco Caserta, Stefan Voß:
A MIP-based framework and its application on a lot sizing problem with setup carryover. J. Heuristics 19(2): 295-316 (2013) - [c9]Marco Caserta, Stefan Voß:
Workgroups Diversity Maximization: A Metaheuristic Approach. Hybrid Metaheuristics 2013: 118-129 - 2012
- [j8]Marco Caserta, Silvia Schwarze, Stefan Voß:
A mathematical formulation and complexity considerations for the blocks relocation problem. Eur. J. Oper. Res. 219(1): 96-104 (2012) - [c8]Marco Caserta, Stefan Voß:
A Math-Heuristic Dantzig-Wolfe Algorithm for the Capacitated Lot Sizing Problem. LION 2012: 31-41 - 2011
- [j7]Stefan Lessmann, Marco Caserta, Idel Montalvo Arango:
Tuning metaheuristics: A data mining based approach for particle swarm optimization. Expert Syst. Appl. 38(10): 12826-12838 (2011) - [j6]Marco Caserta, Stefan Voß, Moshe Sniedovich:
Applying the corridor method to a blocks relocation problem. OR Spectr. 33(4): 915-929 (2011) - 2010
- [c7]Marco Caserta, Adriana Ramirez, Stefan Voß:
A Math-Heuristic for the Multi-Level Capacitated Lot Sizing Problem with Carryover. EvoApplications (2) 2010: 462-471 - [c6]Marco Caserta, Stefan Voß:
A Math-Heuristic Algorithm for the DNA Sequencing Problem. LION 2010: 25-36 - [p2]Marco Caserta, Stefan Voß:
Metaheuristics: Intelligent Problem Solving. Matheuristics 2010: 1-38
2000 – 2009
- 2009
- [j5]Marco Caserta, E. Quiñonez Rico:
A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times. Comput. Oper. Res. 36(2): 530-548 (2009) - [j4]Marco Caserta, A. Márquez Uribe:
Tabu search-based metaheuristic algorithm for software system reliability problems. Comput. Oper. Res. 36(3): 811-822 (2009) - [j3]Marco Caserta, Marta Cabo Nodar:
A cross entropy based algorithm for reliability problems. J. Heuristics 15(5): 479-501 (2009) - [j2]Marco Caserta, E. Quiñonez Rico:
A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems. J. Oper. Res. Soc. 60(10): 1439-1448 (2009) - [c5]Marco Caserta, Silvia Schwarze, Stefan Voß:
A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic. EvoCOP 2009: 37-48 - [c4]Marco Caserta, Stefan Voß:
A Corridor Method-Based Algorithm for the Pre-marshalling Problem. EvoWorkshops 2009: 788-797 - [c3]Marco Caserta, Stefan Voß:
Corridor Selection and Fine Tuning for the Corridor Method. LION 2009: 163-175 - 2008
- [j1]Marco Caserta, E. Quiñonez Rico, A. Márquez Uribe:
A cross entropy algorithm for the Knapsack problem with setups. Comput. Oper. Res. 35(1): 241-252 (2008) - [c2]Marco Caserta, Stefan Lessmann, Stefan Voß:
A Novel Approach to Construct Discrete Support Vector Machine Classifiers. GfKl 2008: 115-125 - [c1]Marco Caserta, Stefan Voß:
A Cooperative Strategy for Guiding the Corridor Method. NICSO 2008: 273-286 - 2007
- [p1]Marco Caserta:
Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems. Metaheuristics 2007: 43-63
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-04-25 05:43 CEST 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:
