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

DOI10.1007/S10878-020-00608-XMaRDI QIDQ2084609zbMATH OpenOpenAlexFDO

Authors Mingyu Xiao, Jianan Zhang, Weibo Lin

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 programmingfixed-parameter tractableparameterized complexitytraveling purchaser problem

Mathematics Subject Classification ID

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

Recommendations

• The traveling purchaser problem and its variants
• Improved solutions for the traveling purchaser problem.
• A heuristic approach for the travelling purchaser problem
• The traveling purchaser problem with fast service option
• Models for a traveling purchaser problem with additional side-constraints

Cites work

• A branch and bound algorithm for the traveling purchaser problem
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• A Dynamic Programming Approach to Sequencing Problems
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
• Color-coding
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Exploring greedy criteria for the dynamic traveling purchaser problem
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• scientific article; zbMATH DE number 125608 (Why is no real title available?)
• scientific article; zbMATH DE number 1405785 (Why is no real title available?)
• Improved Algorithms for Bipartite Network Flow
• LP can be a cure for parameterized problems
• Models for a traveling purchaser problem with additional side-constraints
• Solving the asymmetric traveling purchaser problem
• The bi-objective traveling purchaser problem with deliveries
• The distance constrained multiple vehicle traveling purchaser problem
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• The traveling purchaser problem and its variants
• The traveling purchaser problem with budget constraint
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms
• The traveling purchaser problem with time-dependent quantities
• Travelling purchaser problem

Cited in

(6)

• The traveling purchaser problem and its variants
• Parameterized algorithms for the Traveling Purchaser problem with additional constraints
• Logic-Based Decomposition Methods for the Travelling Purchaser Problem
• scientific article; zbMATH DE number 1405785 (Why is no real title available?)
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms
• Utilizing multi-vehicle traveling purchaser problem for multiple-supplier selection and multi-period lot-sizing in a fuzzy demand environment

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084609)