Visualizing of large trees, resulting in solving optimization problems by branch and bound algorithm
Abstract
In this paper, we consider a method of storage, analysis and visualizing of large trees with the amount of 100 million nodes and more resulting in solving optimization problems by branch and bound algorithm. The solution provides a method for the collection of primary data from solver, analysis and processing of this data, as well as their subsequent visualization. The paper describes the architecture and basic software modules of the proposed solution.
Full Text:
PDF (Russian)References
Osman Y. Ozaltın, Brady Hunsaker. Visualizing Branch-and-Bound Algorithms. Industrial Engineering Department, University of Pitts-burgh, Pittsburgh, PA 15261, USA. Ted K. Ralphs Industrial and Systems Engineering, Lehigh University, Bethlehem, PA 18015-1582, USA. 2004.
Edward M. Reingold and John S. Tilford. Tidier Drawings of Trees. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. SE-7, NO. 2, March 1981.
John Q. Walker II A Node-Positioning Algorithm for General Trees. The University of North Carolina at Chapel Hill Department of Computer Science CB#3175, Sitterson Hall Chapel Hill, NC 27599-3175. September, 1989.
Cristoph Buchheim, Michael Junger, and Sebastian Leipert. Improving Walker's Algorithm to Run in Linear Time.
Donal'd Knut. Iskusstvo programmirovanija, tom 1. Osnovnye algoritmy = The Art of Computer Programming, vol.1. Fundamental Algorithms. — 3-e izd. — M.: «Vil'jams», 2006.
Refbacks
- There are currently no refbacks.
Abava Кибербезопасность MoNeTec 2024
ISSN: 2307-8162