The traveling purchaser problem with budget constraint

DOI10.1016/j.cor.2008.09.001zbMath1158.90416OpenAlexW2087677895MaRDI QIDQ1013406

Renata Mansini, Barbara Tocchella

Publication date: 17 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.09.001

zbMATH Keywords

local searchbudget constrainttraveling purchaser problemmulti-start variable neighborhood search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (10)

The bi-objective traveling purchaser problem with deliveries ⋮ The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach ⋮ An effective matheuristic for the capacitated total quantity discount problem ⋮ The traveling purchaser problem with time-dependent quantities ⋮ The traveling purchaser problem with fast service option ⋮ The traveling purchaser problem and its variants ⋮ The distance constrained multiple vehicle traveling purchaser problem ⋮ Variable neighbourhood search: methods and applications ⋮ Models for a traveling purchaser problem with additional side-constraints ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants

Cites Work

• Unnamed Item
• A heuristic approach for the travelling purchaser problem
• An efficient algorithm for the minimum capacity cut problem
• Algorithms to solve the orienteering problem: A comparison
• Travelling purchaser problem
• A branch and bound algorithm for the traveling purchaser problem
• Variable neighborhood search
• Improved solutions for the traveling purchaser problem.
• Approximate algorithms for the travelling purchaser problem
• Heuristics for the traveling purchaser problem
• The biobjective travelling purchaser problem
• Dynamic tabu search strategies for the traveling purchaser problem
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem

This page was built for publication: The traveling purchaser problem with budget constraint