EFFICIENT ALGORITHMS FOR TRAVELLING SALESMAN PROBLEMS ARISING IN WAREHOUSE ORDER PICKING

Publisher： Cambridge University Press

E-ISSN： 1446-8735|57|2|166-174

ISSN： 1446-1811

Source： ANZIAM Journal, Vol.57, Iss.2, 2015-10, pp. : 166-174

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Lazy Travelling Salesman Problem in $\mathbb{R}^2$

By Polak Paz   Wolansky Gershon  

ESAIM: Control, Optimisation and Calculus of Variations, Vol. 13, Iss. 3, 2007-06 ,pp. : 538-552

Edp Sciences

Access to resources Recommend Favorite

Efficient spectral-Galerkin algorithms for direct solution of the integrated forms of second-order equations using ultraspherical polynomials

By  

ANZIAM Journal, Vol. 48, Iss. 3, 2007-01 ,pp. : 361-386

Cambridge University Press

Access to resources Recommend Favorite

On highly oscillatory problems arising in electronic engineering

By Condon Marissa   Deaño Alfredo   Iserles Arieh  

ESAIM: Mathematical Modelling and Numerical Analysis, Vol. 43, Iss. 4, 2009-07 ,pp. : 785-804

Edp Sciences

Access to resources Recommend Favorite

Problems of Future GMDH Algorithms Development

By A.G. Ivakhnenko  

Systems Analysis Modelling Simulation, Vol. 43, Iss. 10, 2003-10 ,pp. : 1301-1309

Taylor & Francis Ltd

Access to resources Recommend Favorite

Finite algorithms for linear optimisation problems

By  

Bulletin of the Australian Mathematical Society, Vol. 24, Iss. 2, 1981-10 ,pp. : 315-316

Cambridge University Press

Access to resources Recommend Favorite