Displaying similar documents to “Parallel strategies for solving the FETI coarse problem in the PERMON toolbox”

Foreword

Pironneau Olivier (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

Programming is an area at the interface between scientific computing and applied mathematics which has been very active lately and so it was thought that M2AN should open its pages to it in a special issue. This is because many new tools have appeared ranging from templates in C++ to Java interface library and parallel computing tools. There has been a diffusion of computer sciences into numerical analysis and these new tools have made possible the implementation of very complex methods...

Redinv-SA: la simulated annealing for the quadratic assignment problem

N. M.M. de Abreu, T. M. Querido, P. O. Boaventura-Netto (2010)

RAIRO - Operations Research

Similarity:

An algebraic and combinatorial approach to the study of the Quadratic Assignment Problem produced theoretical results that can be applied to (meta) heuristics to give them information about the problem structure, allowing the construction of algorithms. In this paper those results were applied to inform a Simulated Annealing-type heuristic (which we called RedInv-SA). Some results from tests with known literature instances are presented.

Foreword

Olivier Pironneau (2002)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations

Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau (2008)

RAIRO - Operations Research

Similarity:

Many combinatorial optimization problems can be formulated as the minimization of a 0–1 quadratic function subject to linear constraints. In this paper, we are interested in the exact solution of this problem through a two-phase general scheme. The first phase consists in reformulating the initial problem either into a compact mixed integer linear program or into a 0–1 quadratic convex program. The second phase simply consists in submitting the reformulated problem to a standard solver....