Combinatorial Analysis

Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects.

Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects.

This book introduces readers to an advanced combinatorial testing approach and its application in the cloud environment. Based on test algebra and fault location analysis, the proposed combinatorial testing method can support experiments with 250 components (with 2 * (250) combinations), and can detect the fault location based on the testing results. This function can efficiently decrease the size of candidate testing sets and therefore increase testing efficiency. The proposed solution’s effectiveness in the cloud environment is demonstrated using a range of experiments.

This book constitutes the refereed proceedings of the 23rd European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2023, held as part of Evo*2023, in Brno, Czech Republic in April 2023, co-located with the Evo*2023 events: EvoMUSART, EvoApplications, and EuroGP.