Efficient algorithms for the double traveling salesman problem with multiple stacks

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 May 2012 Italy English Publisher:Elsevier BVJournal:Computers & Operations Research, volume 39, pages 1,044-1,053 (issn: 0305-0548,

Copyright policy )

Authors: M. Casazza; A. Ceselli; M. Nunkesser;

doi: 10.1016/j.cor.2011.06.008

handle: 2434/290567 , 2434/169585

Efficient algorithms for the double traveling salesman problem with multiple stacks

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Country

Italy

Related Organizations

Institute of Theoretical Computer Science
Switzerland
University of Milan
Italy
ETH Zurich
Switzerland

Keywords

Transportation, logistics and supply chain management, Combinatorial optimization, traveling salesman problem, efficient algorithms, heuristics, Dynamic programming, LIFO constraints, Approximation methods and heuristics in mathematical programming, Traveling Salesman Problem; LIFO constraints; Efficient algorithms; Heuristics

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	24
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%