نتایج جستجو برای: solid travelling salesman problem

تعداد نتایج: 1066035  

2007
Derek Barker

A new form of scholarship, the scholarship of engagement, is emerging as a distinct set of practices within the general movement toward civic renewal in American higher education. This essay defines the core aspects of the scholarship of engagement and creates a taxonomy of five forms of engaged scholarship. Using a problem-driven, pluralistic approach, this essay concludes that the new forms o...

Journal: :SIAM Journal on Optimization 1995
Sylvia C. Boyd William H. Cunningham Maurice Queyranne Yaoguang Wang

We introduce a new class of valid inequalities for the symmetric travelling salesman polytope. The family is not of the common handle-tooth variety. We show that these inequalities are all facet-inducing and have Chvv atal rank 2.

2014
Maria Battarra Gilbert Laporte Daniele Vigo

Full terms and conditions of use:

2009
Eranda Cela Vladimir Deineko Gerhard Woeginger

This paper deals with a special case of the Euclidean Travelling Salesman Problem known as the x-and-y-axes TSP. In this special case, all cities are situated on the x-axis and on the y-axis of an orthogonal coordinate system for the Euclidean plane. We show that the problem can be solved in O(n) time.

2002
GREGORY GUTIN ABRAHAM PUNNEN Gregory Gutin Anders Yeo Alexei Zverovitch

Journal: :Operations Research 1988
Patrick Jaillet

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive...

Journal: :CoRR 2017
Abraham P. Punnen Brad D. Woods Santosh N. Kabadi

We consider the linearization problem associated with the quadratic traveling salesman problem (QTSP). Necessary and sufficient conditions are given for a cost matrix Q of QTSP to be linearizable. It is shown that these conditions can be verified in O(n) time. Some simpler sufficient conditions for linearization are also given along with related open problems.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید