Category: Algorithm
Probabilistic branch-and-bound can approximate Pareto-optimal sets
—
in AlgorithmWhat the study found The study presents Multiple Objective Probabilistic Branch and Bound with Single Observation (MOPBnB(so)), an algorithm for approximating the Pareto optimal set and the associated efficient frontier in stochastic multi-objective optimization problems. Why the authors say this matters The authors indicate that the algorithm is intended to handle noisy objective evaluations more…
Review finds Thomson encoding and Grover selection central in QGAs
—
in AlgorithmWhat the study found The paper concludes that the encoding used for the Thomson problem, a problem about arranging particles on a sphere, is a decisive step toward using quantum genetic algorithms in a range of physical applications. It also concludes that Grover's search, a quantum search method, as a selection step in Reduced QGAs…
Algorithm enumerates maximal balanced quasi-cliques in signed graphs
—
in AlgorithmDiscover maximal balanced quasi-clique enumeration for signed graphs. A novel NP-hard algorithm identifies cohesive subgraphs with positive and negative edges using branch-and-bound optimization.
Enhanced grey wolf optimization improved cloud load balancing
—
in AlgorithmEnhanced optimization algorithm for cloud load balancing achieves 25% improvement in resource utilization and outperforms standard metaheuristic approaches in benchmark testing.
Improved black-winged kite algorithm outperformed comparison methods
—
in AlgorithmImproved black-winged kite optimization algorithm combining multiple strategies to prevent local optima and enhance convergence, with application to predictive modeling.
Parallel conflict graph management reduced MIP solve time
—
in AlgorithmParallel algorithms for conflict graph management in mixed-integer programming enable larger cutting plane pools and substantially reduce solver times, especially for difficult problem instances.
