We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E....

AMS classification: 90C22, 20Cxx, 70-08

AMS classification: 90C22, 20Cxx, 70-08

AMS classification: 90C22, 20Cxx, 70-08

AMS classifications: 05C69; 90C35; 90C22;

A warranty distribution network provides aftersales warranty services to customers and resembles a closed-loop supply chain network with specific challenges for reverse flows management like recovery, repair, and reflow of refurbished products. We present here a nonlinear and nonconvex mixed...

In this article we propose an aggregate optimization approach by formulating the multi-head SMD placement optimization problem into a mixed integer program (MIP) with the variables based on batches of components. This MIP is tractable and effective in balancing workload among placement heads,...

We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion. In order to solve the POPs of high degree, we develop a cutting-plane algorithm based on...

We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion. In order to solve the POPs of high degree, we develop a cutting-plane algorithm based on...