Displaying similar documents to “A new heuristic for the quadratic assignment problem.”

Stochastic bottleneck transportation problem with flexible supply and demand quantity

Yue Ge, Hiroaki Ishii (2011)

Kybernetika

Similarity:

We consider the following bottleneck transportation problem with both random and fuzzy factors. There exist m supply points with flexible supply quantity and n demand points with flexible demand quantity. For each supply-demand point pair, the transportation time is an independent positive random variable according to a normal distribution. Satisfaction degrees about the supply and demand quantity are attached to each supply and each demand point, respectively. They are denoted by membership...

A branch&bound algorithm for solving one-dimensional cutting stock problems exactly

Guntram Scheithauer, Johannes Terno (1995)

Applicationes Mathematicae

Similarity:

Many numerical computations reported in the literature show only a small difference between the optimal value of the one-dimensional cutting stock problem (1CSP) and that of the corresponding linear programming relaxation. Moreover, theoretical investigations have proven that this difference is smaller than 2 for a wide range of subproblems of the general 1CSP.

Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods

Jacek Błaszczyk, Andrzej Karbowski, Krzysztof Malinowski (2007)

International Journal of Applied Mathematics and Computer Science

Similarity:

The main purpose of this paper is to describe the design, implementation and possibilities of our object-oriented library of algorithms for dynamic optimization problems. We briefly present library classes for the formulation and manipulation of dynamic optimization problems, and give a general survey of solver classes for unconstrained and constrained optimization. We also demonstrate methods of derivative evaluation that we used, in particular automatic differentiation. Further, we...

On the preconditioned biconjugate gradients for solving linear complex equations arising from finite elements

Michal Křížek, Jaroslav Mlýnek (1994)

Banach Center Publications

Similarity:

The paper analyses the biconjugate gradient algorithm and its preconditioned version for solving large systems of linear algebraic equations with nonsingular sparse complex matrices. Special emphasis is laid on symmetric matrices arising from discretization of complex partial differential equations by the finite element method.

Solving conics over function fields

Mark van Hoeij, John Cremona (2006)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let F be a field whose characteristic is not  2 and K = F ( t ) . We give a simple algorithm to find, given a , b , c ∈ K * , a nontrivial solution in  K (if it exists) to the equation a X 2 + b Y 2 + c Z 2 = 0 . The algorithm requires, in certain cases, the solution of a similar equation with coefficients in F ; hence we obtain a recursive algorithm for solving diagonal conics over ℚ ( t 1 , ⋯ , t n ) (using existing algorithms for such equations over  ℚ ) and over 𝔽 q ( t 1 , ⋯ , t n ) .