A heuristic manipulation technique for the sequential ordering problem
type: Item
instance of: scholarly article
title: A heuristic manipulation technique for the sequential ordering problem
zbMATH Open document ID: 1278.90168
published in: Computers \& Operations Research
publication date: 2008-05-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5278687
zbMATH Keywords: problem manipulation techniques
zbMATH Keywords: ant colony optimization
zbMATH Keywords: asymmetric travelling salesman
zbMATH Keywords: scheduling
author: Roberto Montemanni
author: Derek H. Smith
author: Luca Maria Gambardella
MaRDI profile type: Publication
full work available at URL: j.cor.2007.05.003
OpenAlex ID: W2079697662
cites work: An inexact algorithm for the sequential ordering problem
cites work: Q4436884
cites work: An efficient implementation of local search algorithms for constrained routing problems
cites work: Q4875843
cites work: A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
cites work: A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
cites work: The precedence-constrained asymmetric traveling salesman polytope
cites work: Q4667106
cites work: An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
DOI: 10.1016/J.COR.2007.05.003
description: scientific article; zbMATH DE number 5278687