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

Publisher： John Wiley & Sons Inc

E-ISSN： 1475-3995|24|1-2|77-98

ISSN： 0969-6016

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

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

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

By  

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

John Wiley & Sons Inc

Access to resources Recommend Favorite

A biased random‐key genetic algorithm for the minimization of open stacks problem

By  

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol. 23, Iss. 1-2, 2016-01 ,pp. : 25-46

John Wiley & Sons Inc

Access to resources Recommend Favorite

LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs

By Nowak Ivo  

Central European Journal of Operations Research, Vol. 16, Iss. 2, 2008-06 ,pp. : 127-138

Springer Publishing Company

Access to resources Recommend Favorite

An interactive memetic algorithm for production and manufacturing problems modelled as a multi-objective travelling salesman problem

By Samanlioglu F.  

International Journal of Production Research, Vol. 50, Iss. 20, 2012-10 ,pp. : 5671-5682

Taylor & Francis Ltd

Access to resources Recommend Favorite

A competitive branch-and-bound algorithm for the simple assembly line balancing problem

By Sprecher A.  

International Journal of Production Research, Vol. 37, Iss. 8, 1999-05 ,pp. : 1787-1816

Taylor & Francis Ltd

Access to resources Recommend Favorite