The traveling purchaser problem with budget constraint
type: Item
instance of: scholarly article
title: The traveling purchaser problem with budget constraint
zbMATH Open document ID: 1158.90416
author: Renata Mansini
author: Barbara Tocchella
published in: Computers \& Operations Research
publication date: 2009-04-17T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5544748
zbMATH Keywords: traveling purchaser problem
zbMATH Keywords: budget constraint
zbMATH Keywords: local search
zbMATH Keywords: multi-start variable neighborhood search
MaRDI profile type: Publication
full work available at URL: j.cor.2008.09.001
OpenAlex ID: W2087677895
cites work: Travelling purchaser problem
cites work: A branch and bound algorithm for the traveling purchaser problem
cites work: Q4938770
cites work: Approximate algorithms for the travelling purchaser problem
cites work: Improved solutions for the traveling purchaser problem.
cites work: Dynamic tabu search strategies for the traveling purchaser problem
cites work: Heuristics for the traveling purchaser problem
cites work: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
cites work: The biobjective travelling purchaser problem
cites work: A heuristic approach for the travelling purchaser problem
cites work: Algorithms to solve the orienteering problem: A comparison
cites work: Variable neighborhood search
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: An efficient algorithm for the minimum capacity cut problem
DOI: 10.1016/J.COR.2008.09.001
description: scientific article; zbMATH DE number 5544748