Algorithm unions for solving discrete optimization problems

DOI10.1007/s10559-023-00611-0MaRDI QIDQ6066035

V. O. Roshchyn, Vladimir P. Shylo, Ivan V. Sergienko

Publication date: 15 November 2023

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

information exchangediscrete optimizationexperimental researchalgorithm union efficiencyalgorithm unions (portfolios and teams)

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (1)

Multi-criteria optimization problems with vector heterogeneous convolutions of criteria

Cites Work

• Solving unconstrained binary quadratic programming problem by global equilibrium search
• On algorithm portfolios and restart strategies
• Restart strategies in optimization: parallel and serial cases
• Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
• Solving a network design problem
• Topical directions of informatics. In memory of V. M. Glushkov
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• A Spectral Bundle Method for Semidefinite Programming
• Algorithm Portfolios
• Algorithm portfolios
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithm unions for solving discrete optimization problems