Parallel algorithm portfolios with adaptive resource allocation strategy

DOI10.1007/s10898-022-01162-yOpenAlexW4225134652MaRDI QIDQ6200379

Ilias S. Kotsireas, K. E. Parsopoulos, Vasileios A. Tatsis, Panos M. Pardalos

Publication date: 22 March 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-022-01162-y

zbMATH Keywords

global optimizationmetaheuristicsresource allocationalgorithm portfoliosadaptive pursuit

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Preface

Cites Work

• Unnamed Item
• Unnamed Item
• Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics
• Selecting algorithms for large berth allocation problems
• Parallel Algorithm Portfolio with Market Trading-Based Time Allocation
• A new approach to the design of reinforcement schemes for learning automata
• Algorithm Portfolios
• An Algorithm Portfolio for the Sub-graph Isomorphism Problem
• A Simplex Method for Function Minimization

This page was built for publication: Parallel algorithm portfolios with adaptive resource allocation strategy