TSPSG is intended to generate and solve "travelling salesman problem" (TSP) tasks. It uses the Branch and Bound method for solving. Its input is a number of cities and a matrix of city-to-city travel costs. The matrix can be populated with random values in a given range (which is useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving, and a solving graph. The task can be saved in an internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using the Branch and Bound method to solve a particular task.

Rocket Propulsion Analysis (RPA) is a tool for the performance prediction of rocket engines. By providing a few engine parameters such as combustion chamber pressure, used propellant components, and nozzle parameters, the program obtains chemical equilibrium composition of combustion products, determines its thermodynamic properties, and predicts the theoretical rocket performance. A robust, proven, and industry-accepted Gibbs free energy minimization approach is used to obtain the combustion composition. It can perform analysis of nozzle flows with shifting and frozen chemical equilibrium, optimization of propellant components mixture ratio for maximum specific impulse of bipropellant systems, altitude performance analysis, analysis of nozzle performance with respect to overexpansion and flow separation, throttled engine performance analysis, estimation of test (actual) nozzle performance, and nested analysis: stepping of up to four independent variables (component ratio, chamber pressure, nozzle inlet conditions, and nozzle exit conditions).