Topos Quantum Theory (TQT) is standardly portrayed as a kind of ‘neo-realist’ reformulation of quantum mechanics. In this paper, we study the extent to which TQT can really be characterised as a realist formulation of the theory, and examine the question of whether the kind of realism that is provided by TQT satisfies the philosophical motivations that are usually associated with the search for...

This article deals with a study of the MPEC problem based on a reformulation to a DC problem (Difference of Convex functions). This reformulation is obtained by a partial penalization of the constraints. In this article we prove that a classical optimality condition for a DC program, if a constraint qualification is satisfied for MPEC, it is a necessary and sufficient condition for a feasible p...

A conditional constraint satisfaction problem (CCSP) extends a standard constraint satisfaction problem (CPS) with a conditionbased component that controls what variables participate in problem solutions. CCSPs adequately represent configuration and design problems in which selected subsets of variables, rather than the entire variable set, are relevant to final solutions. The only algorithm th...

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....