This paper presents an exact combinatorial algorithm for solving the Discrete Berth
Allocation Problem (DBAP) and the Hybrid Berth Allocation Problem (HBAP) with fixed …

This study considers the Dynamic Minimum Cost Hybrid Berth Allocation Problem
(DMCHBAP) with fixed handling times of vessels. The objective function to be minimized …

Abstract The Minimum Cost Hybrid Berth Allocation problem is defined as follows: for a
given list of vessels with fixed handling times, the appropriate intervals in berth and time …

A new optimization method based on the Evolutionary Algorithm (EA) is developed for
solving the Minimum Cost Hybrid Berth Allocation Problem (MCHBAP) with fixed handling …

The static minimum cost berth allocation problem (MCHBAP) is considered with an aim to
minimize the total costs consisting of costs of positioning, speeding up or waiting, and …

Проблеми задовољења ограничења, којима припадају и проблеми оптимизације,
спадају у веома значајне проблеме дискретне математике са широким пољем …

Constrain satisfaction problems including the optimisation problems are among the most
important problems of discrete mathematics with wide area of application in mathematics …

МЕТОД СЕДИМЕНТАЦИЈЕ И ЊЕГОВЕ ПРИМЈЕНЕ У ПРОБЛЕМИМА ДИСКРЕТНЕ
МАТЕМА Page 1 УНИВЕРЗИТЕТ У БЕОГРАДУ МАТЕМАТИЧКИ ФАКУЛТЕТ Стеван Љ …

UTICAJ POLOŢAJA PEJSMEJKER ELEKTRODE NA FUNKCIJU LEVE KOMORE KOD
PACIJENATA SA PERMANENTNIM ANTIBRADIKARDNIM PEJSINGOM Page 1 …