This paper proposes a column generation based heuristic suitable for large and hard instances of the generalized assignment problem. First, just to be able to obtain the convergence of the column generation is reasonable times, it uses a sophisticated “triple” dual stabilization, combining piecewise linear penalty functions, Wentges’ dual smoothing and sub-gradient directional smoothing. In ord...

This study proposes a new approach for single-sampling plan by determining sample size and acceptance number. The proposed approach is based on a two-step methodology. In the first step: quality management step, different single sampling inspection plans were generated by running an optimization model for different possible acceptance numbers. While, in the second step: Multi-Attribute Decision...

We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP), that may be obtained via an SDP relaxation of the more general quadratic assignment problem (QAP). We show that the new relaxation dominates the one in the paper: [D. Cvetković, M. Cangalović and V. Kovačević-Vujčić. Semidefinite Programming Methods for the Symmetric Traveling Salesman...

The application of the Reformulation Linearization Technique (RLT) to the Quadratic Assignment Problem (QAP) leads to a tight linear relaxation with huge dimensions that is hard to solve. Previous works found in the literature show that these relaxations combined with branch-and-bound algorithms belong to the state-of-the-art of exact methods for the QAP. For the level 3 RLT (RLT3), using this ...

We consider the bicriterion multimodal assignment problem, which is a new generalization of the classical linear assignment problem. A two-phase solution method using an effective ranking scheme is presented. The algorithm is valid for generating all nondominated criterion points or an approximation. Extensive computational results are conducted on a large library of test instances to test the ...

In this thesis we analyze scheduling in wireless networks under the physical model. In particular, we ask the following question. Given n communication requests as pairs of nodes from a metric space, how fast can we schedule all of them? We have to assign a schedule slot and a transmission power to each request and need to ensure that during each schedule step the interference at the addressed ...

The construction of a closed-loop observer for linear control systems and the associated eigenvalue assignment problem are classical tasks in Control Theory. The present paper describes an algorithm for the solution of this eigenvalue assignment problem. The algorithm is based on the implicitly restarted Arnoldi method, and is well suited for large-scale problems, that require the (re)assignmen...

Derman, Lieberman and Ross solved the problem of sequentially assigning n components with different reliabilities to a consecutive-2 linear system to maximize the system reliability. Furthermore, they show that the optimal assignment is invariant, i.e., it depends only on the ranking of the component reliabilities, but not their values. We study the same problem for the consecutive-2 circular s...