English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Nobody has yet been able to determine the optimal solution conclusively whether NP-complete problems are in fact solvable in polynomial time. Gueret et al. tries to obtain the optimal solution using linear programming with   time complexity for barge loading problem a kind of bin packing problem that is classified as nondeterministic polynomial time (NP)-complete problem. On the other hand, this paper suggests the loading rule of profit priority rank algorithm with  log time complexity. This paper decides the profit priority rank firstly. Then, we obtain the initial loading result using the rule of loading the good has profit priority order. Finally, we balance the loading and capability of barge swap the goods of unloading in previously loading in case of under loading. As a result of experiments, this algorithm reduces the   of linear programming to  logtime complexity for NP-complete barge loading ∙1 :  ∙ : 2014. 07. 15,  : 2014. 07. 28,  : 2014. 08. 24. *   (Dept. of Multimedia Eng., Gangneung-Wonju National University) 170 Journal of The Korea Society of Computer and Information October 2014

Maximum Profit Priority Goods First Loading Algorithm for Barge Loading Problem