Complexity of One Packing Optimization Problem

Trofymchuk, Oleksandr; Vasyanin, V. A.; Kuzmenko, Viktor

doi:10.1007/s10559-016-9802-9

Cited by 4 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The paper [5] presents the results of experimental analysis of two simple packing algorithms in case of variation of boundaries for the initial values MIN…”

Section: Problem Solution Algorithmsmentioning

confidence: 99%

“…for fixed w. In the present paper, as well as in [5], we consider three possible cases when transformation (5) …”

Section: Problem Solution Algorithmsmentioning

confidence: 99%

“…The value of C 1 can be big enough as compared with n max C 2 and can attain ( ) n n 2 -. Thus, in the asymptotics the run time of the algorithm is not better than O Cn ( )5 , where C C = n max 2 .…”

mentioning

confidence: 98%

See 2 more Smart Citations

Optimization Algorithms for Packing of Small-Lot Correspondence in Communication Networks

2016

Self Cite

View full text Add to dashboard Cite

The paper discusses algorithms to solve packing optimization problem, which arises in sorting and packing of small-lot cargo in containers in mainline transportation networks or in merging messages into virtual containers in backbone data transmission networks. A problem statement is proposed and its specific properties and approaches to the solution are discussed. The convergence and time complexity of the number of heuristic algorithms are analyzed and numerical experiments are used to investigate their comparative efficiency. It is shown experimentally that solutions results obtained by different optimization strategies based on networks that have up to 500 nodes differ by no more than 2.65%.

show abstract

“…The paper [5] presents the results of experimental analysis of two simple packing algorithms in case of variation of boundaries for the initial values MIN…”

Section: Problem Solution Algorithmsmentioning

confidence: 99%

“…for fixed w. In the present paper, as well as in [5], we consider three possible cases when transformation (5) …”

Section: Problem Solution Algorithmsmentioning

confidence: 99%