Lower tolerance-based Branch and Bound algorithms for the ATSP
In this paper, we develop a new tolerance-based Branch and Bound algorithm for solving NP-hard problems. In particular, we consider the asymmetric traveling salesman problem (ATSP), an NP-hard problem with large practical relevance. The main algorithmic contribution is our lower bounding strategy that uses the expected costs of including arcs in the solution to the assignment problem relaxation of the ATSP, the so-called lower tolerance values. The computation of the lower bound requires the calculation of a large set of lower tolerances. We apply and adapt a finding from that makes it possible to compute all lower tolerance values efficiently. Computational results show that our Branch and Bound algorithm exhibits very good performance in comparison with state-of-the-art algorithms, in particular for difficult clustered ATSP instances.
The article considers the issues of estimating the temperature tolerances of housings radio electronic elements mounted on the circuit board. Describes the methods of calculation of tolerances and key ratios calculated. The expediency of application of the Monte-Carlo method for calculation of tolerances temperature corps radio electronic elements mounted on the circuit board.
In this paper we consider two branch and bound algorithms for the maximum clique problem which demonstrate the best performance on DIMACS instances among the existing methods. These algorithms are MCS algorithm by Tomita et al. (2010) and MAXSAT algorithm by Li and Quan (2010a, b). We suggest a general approach which allows us to speed up considerably these branch and bound algorithms on hard instances. The idea is to apply a powerful heuristic for obtaining an initial solution of high quality. This solution is then used to prune branches in the main branch and bound algorithm. For this purpose we apply ILS heuristic by Andrade et al. (2012). The best results are obtained for p_hat1000-3 instance and gen instances with up to 11,000 times speedup.
The Cell Formation Problem (CFP) is an NP-hard optimization problem considered for cellular man- ufacturing systems. Because of its high computational complexity there have been developed a lot of heuristics and almost no exact algorithms for solving this problem. In this paper we suggest a branch- and-bound algorithm which provides exact solutions for the CFP with the grouping efficacy objective function. To linearize this fractional objective function we apply the Dinkelbach approach. Our algorithm finds optimal solutions for 24 of the 35 popular benchmark instances from literature and for the remaining instances it finds good solutions close to the best known. The difference in the grouping efficacy with the best known solutions is always less than 1.5%.
Infocommunication services industry is a branch of material production involved in the creation of material goods and national income. Each production industry, except for the General features peculiar to all branches of material production, has its own characteristics, leaving an imprint on the nature of its enterprises. In the field of Infocommunications, this is primarily a feature of the subject of labor, which are the services provided to their consumers using infocommunication systems. Infocommunication products are not in the form of a product or thing. K. Marx called it a useful effect delivered to the consumer of this effect through the transmission of messages (information, content). Despite the immaterial nature of infocommunication products, it is material, as it is a product of spatial movement, which by its nature is material
The cell formation problem (CFP) is an NP-hard optimization problem considered for cell manufacturing systems. Because of its high computational complexity several heuristics have been developed for solving this problem. In this paper we present a branch and bound algorithm which provides exact solutions of the CFP. This algorithm finds optimal solutions for 13 problems of the 35 popular benchmark instances from the literature.
The article considers the Views of L. N. Tolstoy not only as a representative, but also as a accomplisher of the Enlightenment. A comparison of his philosophy with the ideas of Spinoza and Diderot made it possible to clarify some aspects of the transition to the unique Tolstoy’s religious and philosophical doctrine. The comparison of General and specific features of the three philosophers was subjected to a special analysis. Special attention is paid to the way of thinking, the relation to science and the specifics of the worldview by Tolstoy and Diderot. An important aspect is researched the contradiction between the way of thinking and the way of life of the three philosophers.
Tolstoy's transition from rational perception of life to its religious and existential bases is shown. Tolstoy gradually moves away from the idea of a natural man to the idea of a man, who living the commandments of Christ. Starting from the educational worldview, Tolstoy ended by creation of religious and philosophical doctrine, which were relevant for the 20th century.
This important new book offers the first full-length interpretation of the thought of Martin Heidegger with respect to irony. In a radical reading of Heidegger's major works (from Being and Time through the ‘Rector's Address' and the ‘Letter on Humanism' to ‘The Origin of the Work of Art' and the Spiegel interview), Andrew Haas does not claim that Heidegger is simply being ironic. Rather he argues that Heidegger's writings make such an interpretation possible - perhaps even necessary.
Heidegger begins Being and Time with a quote from Plato, a thinker famous for his insistence upon Socratic irony. The Irony of Heidegger takes seriously the apparently curious decision to introduce the threat of irony even as philosophy begins in earnest to raise the question of the meaning of being. Through a detailed and thorough reading of Heidegger's major texts and the fundamental questions they raise, Haas reveals that one of the most important philosophers of the 20th century can be read with as much irony as earnestness. The Irony of Heidegger attempts to show that the essence of this irony lies in uncertainty, and that the entire project of onto-heno-chrono-phenomenology, therefore needs to be called into question.
The article is concerned with the notions of technology in essays of Ernst and Friedrich Georg Jünger. The special problem of the connection between technology and freedom is discussed in the broader context of the criticism of culture and technocracy discussion in the German intellectual history of the first half of the 20th century.
This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.
A form for an unbiased estimate of the coefficient of determination of a linear regression model is obtained. It is calculated by using a sample from a multivariate normal distribution. This estimate is proposed as an alternative criterion for a choice of regression factors.