نتایج جستجو برای: solid travelling salesman problem
تعداد نتایج: 1066035 فیلتر نتایج به سال:
We present the concept of “problem perturbation“, give the specifications of an application to the Travenling Salesperson Problem (TSP), then discuss an empiricd study of the fitness landscape induced by the variation operators in that application.
We are interested in characterizing the compact sets of the Heisenberg group that are contained in a curve of finite length. Ferrari, Franchi and Pajot recently gave a sufficient condition for those sets, adapting a necessary and sufficient condition due to P. Jones in the Euclidean setting. We prove that this condition is not necessary.
We describe a computer code and data that together certify the optimality of a solution to the 85,900-city traveling salesman problem pla85900, the largest instance in the TSPLIB collection of challenge problems.
A crucial part of the contemporary interest in logicism in the philosophy of mathematics resides in its idea that arithmetical knowledge may be based on logical knowledge. Here an implementation of this idea is considered that holds that knowledge of arithmetical principles may be based on two things: (i) knowledge of logical principles and (ii) knowledge that the arithmetical principles are re...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید