A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks

Manuel A. Alba Martínez; Jean-François Cordeau; Mauro Dell'Amico, Manuel Iori

Year of publication:	2013
Authors:	Martínez, Manuel A. Alba ; Cordeau, Jean-François ; Dell'Amico, Mauro ; Iori, Manuel
Published in:	INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 25.2013, 1, p. 41-55
Subject:	Rundreiseproblem \| Travelling salesman problem \| Algorithmus \| Algorithm \| Tourenplanung \| Vehicle routing problem \| Theorie \| Theory \| Heuristik \| Heuristics \| Ganzzahlige Optimierung \| Integer programming

Check Google Scholar |

More access options

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10009728362

A service of the