Search Results for ""

The arithmetic-geometric spectral radius rho_(AG) of a graph is defined as the largest eigenvalue of its arithmetic-geometric matrix.

An algorithm for partitioning (or clustering) N data points into K disjoint subsets S_j containing N_j data points so as to minimize the sum-of-squares criterion ...

Suppose x_1<x_2<...<x_n are given positive numbers. Let lambda_1, ..., lambda_n>=0 and sum_(j=1)^(n)lambda_j=1. Then ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

A function f(t) of one or more parameters containing a noise term epsilon(t) f(t)=L(t)+epsilon(t), where the noise is (without loss of generality) assumed to be additive.

There are two versions of the moat-crossing problem, one geometric and one algebraic. The geometric moat problems asks for the widest moat Rapunzel can cross to escape if she ...

A term in social choice theory meaning invariance of a result under permutation of voters.

A term in social choice theory meaning a change favorable for X does not hurt X.

A method of stochastic optimization including techniques such as gradient search or Robbins-Monro stochastic approximation.

Operations research is a vast branch of mathematics which encompasses many diverse areas of minimization and optimization. Thousands of books have been written worldwide on ...