Due to their own attributes, small and medium-sized enterprises are quite different from large in various aspects of enterprise management, especially human resource management. In mature enterprises, there is a relatively perfect management system, while most have set mode, but on the whole, it not has many problems. This paper takes as research foothold, studies problems discusses relevant co...

Semidefinite relaxations of quadratic 0-1 programming or graph partitioning problems are well known to be of high quality. However, solving them by primal-dual interior point methods can take much time even for problems of moderate size. Recently we proposed a spectral bundle method that allows to compute, within reasonable time, approximate solutions to structured, large equality constrained s...

We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is specially ...

In several applications of data mining to high-dimensional data, clustering techniques developed for low-to-moderate sized problems obtain unsatisfactory results. This is an aspect of the curse of dimensionality issue. A traditional approach is based on representing the data in a suitable similarity space instead of the original high-dimensional attribute space. In this paper, we propose a solu...

We consider the problem of assigning transmission ranges to the nodes of an ad hoc wireless network, so as that the total power consumed is minimized and the resulting network is biconnected. A biconnected communication graph is important to ensure fault tolerance, since ad hoc networks are used in critical application domains where failures are likely to occur. We present a mixed integer progr...

This paper focuses on the flow shop sequence dependent group scheduling (FSDGS) problem with minimisation of total completion time as the criterion (Fm|fmls, prmu, Splk|∑Cj). The research problem is formulated in form of two different mixed integer linear programming (MILP) models. Comparing with the latest MILP model for the proposed problem in the literature, the complexity size of the propos...

In this paper, we investigate conditions for the unique recoverability of sparse integer-valued signals from few linear measurements. Both the objective of minimizing the number of nonzero components, the so-called l0-norm, as well as its popular substitute, the l1-norm, are covered. Furthermore, integer constraints and possible bounds on the variables are investigated. Our results show that th...