JSTOR Daily

Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming

An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...
IEEE

Overall Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Quadratic Programming

Abstract: This paper presents a method to certify the computational complexity of a standard Branch and Bound method for solving Mixed-Integer Quadratic Programming (MIQP) problems defined as ...
JSTOR Daily

A New Lower Bound for the Quadratic Assignment Problem

This is a preview. Log in through your library . Abstract We introduce a new lower bound for the quadratic assignment problem based on a sequence of equivalent formulations of the problem. We present ...
IEEE

Quadratic Assignment Contrastive Loss and Application on Graph Matching

Abstract: The Quadratic assignment problem (QAP), referring to finding an optimal assignment between two sets of interrelated objects, is a fundamental problem in combinatorial optimization. It is ...
Scientific Research Publishing

Chen, Z. and Xi, F. (2004) A New Branch-and-Bound Algorithm for Solving Large Complex Integer Convex Quadratic Programs. Mathematica Numerica Sinca, 26, 445-458.

ABSTRACT: For solving assignment problems of staff, equipment and task in engineering support action, a 3-Dimensional assignment model is established, which contains staff skill level, equipment ...
Scientific Research Publishing

S. Burer and D. Vandenbussche, “Globally Solving Box- Constrained Nonconvex Quadratic Programs with Semi- definite-Based Finite Branch-and-Bound,” Computational ...

ABSTRACT: The paper presents an approach for avoiding and minimizing the complementary pivots in a simplex based solution method for a quadratic programming problem. The linearization of the problem ...