This article presents an exact cooperative method for the solution of the multidimensional knapsack problem (MKP) which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure....

In this paper, we have proposed a hybrid permutation-coded steady-state genetic algorithm for a single machine scheduling problem with earliness and tardiness costs and no machine idle time. The steady-state genetic algorithm generates schedules, which are further improved by successive...

Value-at-Risk (VaR) has become one of the standard measures for assessing risk not only in the financial industry but also for asset allocations of individual investors. The traditional mean-variance framework for portfolio selection should, however, be revised when the investor's concern is the...

This study investigates the optimal model of Job Integration of Multi-agent in Multimodal Transportations with Time Windows (JIMMTTW). The model is formulated firstly using the graph structure. The problem is NP-Hard. An optimal strategy including two layers is proposed after analysing the...

The necessity of continuously improving managerial planning processes to support cost reduction ambitions is a constant topic in dynamic business environments. Against this background we explore the importance of collaboration in strategic planning processes. Starting from the relevant...