Parameterized algorithms and complexity for the traveling purchaser problem and its variants
type: Item
instance of: scholarly article
title: Parameterized algorithms and complexity for the traveling purchaser problem and its variants
zbMATH Open document ID: 1504.90139
author: Mingyu Xiao
author: Jianan Zhang
author: Weibo Lin
published in: Journal of Combinatorial Optimization
publication date: 2022-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 7603267
zbMATH Keywords: traveling purchaser problem
zbMATH Keywords: fixed-parameter tractable
zbMATH Keywords: dynamic programming
zbMATH Keywords: parameterized complexity
MaRDI profile type: Publication
full work available at URL: s10878-020-00608-x
OpenAlex ID: W3036941816
cites work: Improved Algorithms for Bipartite Network Flow
cites work: Color-coding
cites work: Exploring greedy criteria for the dynamic traveling purchaser problem
cites work: The traveling purchaser problem with time-dependent quantities
cites work: Dynamic Programming Treatment of the Travelling Salesman Problem
cites work: The distance constrained multiple vehicle traveling purchaser problem
cites work: Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
cites work: Q4027320
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: Models for a traveling purchaser problem with additional side-constraints
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
cites work: The traveling purchaser problem with stochastic prices: exact and approximate algorithms
cites work: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
cites work: The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
cites work: The traveling purchaser problem and its variants
cites work: The traveling purchaser problem with budget constraint
cites work: LP can be a cure for parameterized problems
cites work: The bi-objective traveling purchaser problem with deliveries
cites work: Travelling purchaser problem
cites work: Q4938770
cites work: Solving the asymmetric traveling purchaser problem
cites work: A branch and bound algorithm for the traveling purchaser problem
DOI: 10.1007/S10878-020-00608-X
description: scientific article; zbMATH DE number 7603267