multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...

PURPOSE Clinical trials data from National Cancer Institute (NCI)-funded cooperative oncology group trials could be enhanced by merging with external data sources. Merging without direct patient identifiers would provide additional patient privacy protections. We sought to develop and validate a matching algorithm that uses only indirect patient identifiers. METHODS We merged the data from tw...

A new type of tardy cost, called stepwise tardiness, is considered in a single machine problem. The stepwise tardiness scheduling has been found in many practical situations. To the best of our knowledge, there exist few studies directly addressing the problem. In this paper, we develop a heuristic for the single machine total stepwise tardiness (SMTST) problem. In addition, a variable neighbor...

Quantification is well known to be a major ob­ stacle in the construction of a probabilistic net­ work, especially when relying on human experts for this purpose. The construction of a qualitative probabilistic network has been proposed as an initial step in a network's quantification, since the qualitative network can be used to gain prelimi­ nary insight in the projected network's reasoning b...

In information systems research we are using theories and approaches from any different other sciences, reference sciences. This plurality creates the problem which research method we should select. To alleviate this problem we shall here present the stepwise algorithm to find an appropriate research method. We base our steps on the type of research question and the characteristics of the probl...

We present an Isabelle/HOL formalization and total correctness proof for incremental version of Simplex algorithm which is used in most state-of-the-art SMT solvers. Formalization relies on stepwise program and data refinement, starting from a simple specification, going trough a number of fine refinement steps, and ending up in a fully executable functional implementation. Symmetries present i...

A stepwise algorithm for reconstructing minimum evolution (ME) trees from evolutionary distance data is proposed. In each step, a taxon that potentially has a neighbor (another taxon connected to it with a single interior node) is first chosen and then its true neighbor searched iteratively. For m taxa, at most (m-1)!/2 trees are examined and the tree with the minimum sum of branch lengths (S) ...

Quadratic programming is concerned with minimizing a convex quadratic function subject to linear inequality constraints. The variables are assumed to be nonnegative. The unique solution of quadratic programming (QP) problem (QPP) exists provided that a feasible region is non-empty (the QP has a feasible space). A method for searching for the solution to a QP is provided on the basis of statisti...