Parallel algorithm portfolios with adaptive resource allocation strategy

DOI10.1007/S10898-022-01162-YMaRDI QIDQ6200379zbMATH OpenOpenAlexFDO

Authors K. E. Parsopoulos, Vasileios A. Tatsis, Ilias S. Kotsireas, 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

adaptive pursuitalgorithm portfoliosglobal optimizationmetaheuristicsresource allocation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A new approach to the design of reinforcement schemes for learning automata
• A Simplex Method for Function Minimization
• Algorithm Portfolios
• An Algorithm Portfolio for the Sub-graph Isomorphism Problem
• Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics
• scientific article; zbMATH DE number 835705 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Parallel algorithm portfolio with market trading-based time allocation
• Selecting algorithms for large berth allocation problems

Cited in

(1)

• Preface

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200379)