Parameterized algorithms and complexity for the traveling purchaser problem and its variants

DOI10.1007/s10878-020-00608-xzbMath1504.90139OpenAlexW3036941816MaRDI QIDQ2084609

Jianan Zhang, Weibo Lin, Mingyu Xiao

Publication date: 18 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00608-x

zbMATH Keywords

dynamic programmingparameterized complexityfixed-parameter tractabletraveling purchaser problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms
• Exploring greedy criteria for the dynamic traveling purchaser problem
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Models for a traveling purchaser problem with additional side-constraints
• Solving the asymmetric traveling purchaser problem
• The traveling purchaser problem with budget constraint
• Travelling purchaser problem
• A branch and bound algorithm for the traveling purchaser problem
• The bi-objective traveling purchaser problem with deliveries
• The traveling purchaser problem with time-dependent quantities
• The traveling purchaser problem and its variants
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• The distance constrained multiple vehicle traveling purchaser problem
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• Improved Algorithms for Bipartite Network Flow
• Color-coding
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parameterized algorithms and complexity for the traveling purchaser problem and its variants