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 …
The paper presents an application of the divide and conquers strategy to exactly solve the Discrete Berth Allocation Problem (DBAP). After partitioning a problem by divide and …
Constrain satisfaction problems including the optimisation problems are among the most important problems of discrete mathematics with wide area of application in mathematics …