Related Experiment Video
Updated: Aug 2, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
Random costs in combinatorial optimization
1Institut fur Theoretische Physik, Universitat Magdeburg, Universitatsplatz 2, D-39106 Magdeburg, Germany.
Abstract:
The random cost problem is the problem of indentifying the minimum in a list of random numbers. By definition, this problem cannot be solved faster than by exhaustive search. It is shown that a classical NP-hard optimization problem, number partitioning, is essentially equivalent to the random cost problem. On the one hand this explains the bad performance of heuristic approaches to the number partitioning problem, but on the other hand it allows one to calculate the probability distributions of the optimum and suboptimum costs.
Related Concept Videos
Factorial Design
Random Variables
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
Randomized Experiments
Simple randomization
Simple...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Optimization Problems
Methods of Medium Optimization

