this paper introduces a new method for incorporating the performance of alternatives into their ultimate ranking in a linear assignment method. this method is one of multi-criteria decision-making methods, in which the weight of criteria is incorporated in ranking the alternatives, and the distance between the performances of alternatives do not affect in ranking the alternatives. in order to m...

In this study, the La3+/Co3O4 nanoflowers were synthesized by co-precipitation method. The morphology of the La3+/Co3O4NFs were characterized using scanning electron microscopy (SEM), and were further used to modify the graphite screen printed electrode (GSPE). The electrochemical behavior of acetaminophen at La3+/Co<s...

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

Semidefinite relaxations of the quadratic assignment problem (QAP ) have recently turned out to provide good approximations to the optimal value of QAP . We take a systematic look at various conic relaxations of QAP . We first show that QAP can equivalently be formulated as a linear program over the cone of completely positive matrices. Since it is hard to optimize over this cone, we also look ...

3 Why Use SDP? 5 3.1 Tractable Relaxations of Max-Cut . . . . . . . . . . . . . . . . . . . . . . . . 5 3.1.1 Simple Relaxation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1.2 Trust Region Relaxation . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1.3 Box Constraint Relaxation . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1.4 Eigenvalue Bound . . . . . . . . . . . . ...

— Using an approach that seems to be patterned after that of Yannakakis, Hofman argues that an NP-complete problem cannot be formulated as a polynomial bounded-sized linear programming problem. He then goes on to propose a " construct " that he claims to be a " counterexample " to recently published linear programming formulations of the Traveling Salesman Problem (TSP) and the Quadratic Assign...

The Quadratic Assignment Problem (QAP) can be solved by linearization, where one formulates the QAP as a mixed integer linear programming (MILP) problem. On the one hand, most of these linearization are tight, but hardly exploited within a reasonable computing time because of their size. On the other hand, Kaufman and Broeckx formulation [1] is the smallest of these linearizations, but very wea...

We designed a universal human papillomavirus (HPV) typing assay based on target enrichment and whole-genome sequencing (eWGS). The RNA bait included 23,941 probes targeting 191 HPV types and 12 probes targeting beta-globin as a control. We used the Agilent SureSelect XT2 protocol for library preparation, Illumina HiSeq 2500 for sequencing, and CLC Genomics Workbench for sequence analysis. Mappi...

In many experiments, not all explanatory variables can be controlled. When the units arise sequentially, different approaches may be used. The authors study a natural sequential procedure for “marginally restricted” D-optimal designs. They assume that one set of explanatory variables (x1) is observed sequentially, and that the experimenter responds by choosing an appropriate value of the explan...