, describes how the solvers were evaluated, and presents lessons, observations, and general trends. Keywords solver competition · experimental evaluation · robust constraint solvers · black-box 1 Why Organise a Competition? This paper presents the experiences of the organisers of the four constraint solver

The goal of this work is the development of a black-box solver based on the scatter search methodology. In particular, we seek a solver capable of obtaining high quality outcomes to optimization problems for which solutions are represented as a vector of integer values. We refer to these problems

This paper describes a new implementation of an algorithm to find all isolated Nash equilibria in a finite strategic game. The implementation uses the game theory software package Gambit to generate systems of polynomial equations which are necessary conditions for a Nash equilibrium, and polyhedral homotopy continuation via the package PHCpack to compute solutions to the systems. Numerical experiments to characterize the performance of the implementation are reported. In addition, the current and future roles of support enumeration methods in the context of methods for computing Nash equilibria are discussed. 1

to provide ever more modelling and solving options, have become progressively more complex at the cost of both performance and usability. Minion is a black box from the user point of view, deliberately providing few options. This, combined with its raw speed, makes Minion a substantial step towards Puget’s

Abstract We show the importance of selecting good branching variables by exhibiting a family of instances for which an optimal solution is both trivial to find and provably optimal by a fixed-size branch-and-bound tree, but for which state-of-the-art Mixed Integer Programming solvers need

The availability of effective exact or heuristic solution methods for general Mixed-Integer Programs (MIPs) is of paramount importance for practical ap-plications. In the present paper we investigate the use of a generic MIP solver as a black-box “tactical ” tool to explore effectively suitable

We examine the convergence characteristics of a preconditioned Krylov subspace solver applied to the linear systems arising from low-order mixed finite element ap-proximation of the biharmonic problem. The key feature of our approach is that the preconditioning can be realized using any “black-box

This work outlines the use of a black-box fast multipole method to accelerate the far-field computations in an isogeometric boundary element method. The present approach makes use of T-splines to discretise both the geometry and analysis fields allowing a di-rect integration of CAD and analysis

Modern Mixed-Integer Programming (MIP) solvers exploit a rich arsenal of tools to attack hard problems. It is widely accepted by the OR community that the solution of very hard MIPs can take advantage from the solution of a series of time-consuming auxiliary Linear Programs (LPs) intended

This paper presents a grid-enabled system for solving large-scale mixed integer programming (MIP) problems. The system has been developed using Globus and MPICH-G2, and consists of two solvers and of an interface portal. After a brief introduction to Branch, Cut and Price optimization algorithms