Solving the asymmetric traveling purchaser problem
type: Item
instance of: scholarly article
title: Solving the asymmetric traveling purchaser problem
zbMATH Open document ID: 1151.90530
author: Jorge Riera-Ledesma
author: Juan-José Salazar-González
published in: Annals of Operations Research
publication date: 2007-02-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5127449
zbMATH Keywords: traveling salesmen problem
describes a project that uses: ABACUS
MaRDI profile type: Publication
full work available at URL: s10479-006-0014-y
OpenAlex ID: W1980297434
cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: Q4509381
cites work: Heuristics for the traveling purchaser problem
cites work: Sequencing many jobs on a multi-purpose facility
cites work: Q4461906
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
cites work: Transforming asymmetric into symmetric traveling salesman problems
cites work: Q4845366
cites work: Introduction to ABACUS -- a branch-and-cut system
cites work: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
cites work: Approximate algorithms for the travelling purchaser problem
cites work: Technical Note—A Note on Zero-One Programming
cites work: Improved solutions for the traveling purchaser problem.
cites work: Travelling purchaser problem
cites work: A heuristic approach for the travelling purchaser problem
cites work: A branch and bound algorithm for the traveling purchaser problem
cites work: Dynamic tabu search strategies for the traveling purchaser problem
DOI: 10.1007/S10479-006-0014-Y
description: scientific article; zbMATH DE number 5127449