Optimization algorithms for packing of small-lot correspondence in communication networks

DOI10.1007/s10559-016-9822-5zbMath1346.90237OpenAlexW2319980041MaRDI QIDQ315007

O. M. Trofymchuk, V. A. Vasyanin, V. N. Kuz'menko

Publication date: 19 September 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-016-9822-5

zbMATH Keywords

heuristic algorithmspacking optimizationbackbone communication networksconvergence and time complexity of algorithmssmall-lot flows of correspondence

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Application models in control theory (93C95)

Related Items (1)

Problem of groupage cargo routing in the multicommodity transport network with given tariffs and delivery time constraints

Cites Work

• Complexity of one packing optimization problem
• A two-criterion lexicographic algorithm for finding all shortest paths in networks

This page was built for publication: Optimization algorithms for packing of small-lot correspondence in communication networks