A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks

E-ISSN： 1475-3995|22|1|61-75

ISSN： 0969-6016

Source： INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol.22, Iss.1, 2015-01, pp. : 61-75

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

New formulation and branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol. 24, Iss. 1-2, 2017-01 ,pp. : 77-98

John Wiley & Sons Inc

Access to resources Recommend Favorite

A dynamic programming-based heuristic for the variable sized two-dimensional bin packing problem

By Liu Ya

International Journal of Production Research, Vol. 49, Iss. 13, 2011-07 ,pp. : 3815-3831

Taylor & Francis Ltd

Access to resources Recommend Favorite

A fuzzy goal-programming model of machine-tool selection and operation allocation problem in FMS: a quick converging simulated annealing-based approach

By Mishra S.

International Journal of Production Research, Vol. 44, Iss. 1, 2006-01 ,pp. : 43-76

Taylor & Francis Ltd

Access to resources Recommend Favorite

A memetic algorithm with iterated local search for the capacitated arc routing problem

By Liu Tiantang Jiang Zhibin Geng Na

International Journal of Production Research, Vol. 51, Iss. 10, 2013-05 ,pp. : 3075-3084

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Multiple Lender Approach to Understanding Supply and Search in the Equity Lending Market

THE JOURNAL OF FINANCE, Vol. 22-1082, Iss. 2, 2013-04 ,pp. : 559-595

John Wiley & Sons Inc

Access to resources Recommend Favorite