Wyniki wyszukiwania - BazTech

1

Efficient Approximation Methods for Lexicographic Max-Min Optimization

Śliwiński Tomasz

Journal of Telecommunications and Information Technology

|

2024

|

nr 1

46--53

EN

Lexicographic max-min (LMM) optimization is of considerable importance in many fairness-oriented applications. LMM problems can be reformulated in a way that allows to solve them by applying the standard lexicographic maximization algorithm. However, the reformulation introduces a large number of auxiliary variables and linear constraints, making the process computationally complex. In this paper, two approximation schemes for such a reformulation are presented, resulting in problem size reduction and significant performance gains. Their influence on the quality of the solution is shown in a series of computational experiments concerned with the fair network dimensioning and bandwidth allocation problem.

2

Problemy długoterminowej archiwizacji zasobów cyfrowych na przykładzie projektu CREDO

Pałka Piotr, Śliwiński Tomasz, Traczyk Tomasz

Pomiary Automatyka Robotyka

|

2020

|

R. 24, nr 4

27--39

PL

Długoterminowe przechowywanie zasobów cyfrowych jest poważnym problemem, który nie znalazł jeszcze ani dostatecznej uwagi ze strony przemysłu IT, ani powszechnie dostępnych rozwiązań. Zachowanie użyteczności zasobów przechowywanych w archiwum cyfrowym wymaga nie tylko niezawodnego składowania plików z danymi, ale także możliwości skutecznego wyszukania informacji, weryfikacji jej autentyczności oraz jej poprawnej interpretacji, zarówno w sensie technicznym (format danych itd.), jak i semantycznym (zrozumienie informacji w odpowiednim kontekście itp.). Artykuł omawia te problemy i przedstawia ich rozwiązania przyjęte w projekcie CREDO

EN

Long-term archiving of digital resources is a serious problem that has not yet found sufficient attention from the IT industry, nor widely available solutions. Preservation of usability of stored resources in the digital archive requires not only reliable storage of data files, but also the possibility of efficient searching, as well as verification of data authenticity and its correct interpretation both in the technical (data format, etc.), and semantic sense (information understanding in an appropriate context, etc.). The paper discusses these problems and presents solutions adopted in the CREDO project.

3

Clustering heuristic for time-dependent periodic routing problems with complex constraints

Śliwiński Tomasz

Decision Making in Manufacturing and Services

|

2020

|

Vol. 14, no. 2

181--192

EN

Periodic routing and scheduling is of utmost importance in many industries with mobile personnel working in the field: sales representatives, service technicians, suppliers, etc. The resulting optimization problems are of large scale and complexity, mostly due to discrete, combinatorial nature of the systems and due to complicated, nonuniform constraints. In many cases the long-term stability of the customer to personnel allocation is required, leading to the decomposition of the major problem into single employee subproblems. The paper deals with building clusters of customers visited by a single salesperson. The procedure takes into account diverse system requirements and constraints, possible traveling schedules and expected operational costs. The difficulty of the problem lies in its large scale and constraints complexity as well as in troublesome objective evaluation for the given solution. The general solution concept is presented. Its usefulness is supported by the results of the computational experiments.