A branch and bound algorithm for the traveling purchaser problem

DOI10.1016/S0377-2217(96)00313-XMaRDI QIDQ1278659zbMATH OpenFDO

Authors Kashi N. Singh, D. Van Oudheusden

Publication date 23 August 1999

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(96)00313-X

zbMATH Keywords

branch-and-boundplant locationroutingschedulingtraveling purchasertraveling salesmanwarehousing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Improved solutions for the traveling purchaser problem.
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• The traveling purchaser problem and its variants
• Improved heuristics for the traveling purchaser problem.
• Models for a traveling purchaser problem with additional side-constraints

Cites work

• A Dual-Based Procedure for Dynamic Facility Location
• A Dual-Based Procedure for Uncapacitated Facility Location
• An Algorithm for the Traveling Salesman Problem
• Approximate algorithms for the travelling purchaser problem
• scientific article; zbMATH DE number 3568354 (Why is no real title available?)
• Sequencing many jobs on a multi-purpose facility
• Travelling purchaser problem

Cited in

(30)

• The traveling purchaser problem with budget constraint
• Transgenetic algorithm for the traveling purchaser problem
• Improved heuristics for the traveling purchaser problem.
• The bi-objective traveling purchaser problem with deliveries
• The traveling purchaser problem and its variants
• An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
• Heuristics for the traveling purchaser problem
• The biobjective travelling purchaser problem
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants
• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
• A branch-and-cut algorithm for the target visitation problem
• Parameterized algorithms for the Traveling Purchaser problem with additional constraints
• Ant colony optimization for the traveling purchaser problem
• The traveling purchaser problem with fast service option
• Logic-Based Decomposition Methods for the Travelling Purchaser Problem
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
• Automatic production planning of press brakes for sheet metal bending
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• scientific article; zbMATH DE number 1405785 (Why is no real title available?)
• Metaheuristics based on decision hierarchies for the traveling purchaser problem
• Effective algorithms for a bounded version of the uncapacitated TPP
• A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
• Heuristic approaches for the family traveling salesman problem
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms
• Exploring greedy criteria for the dynamic traveling purchaser problem
• An iterated local search algorithm for the traveling purchaser problem
• A heuristic approach for the travelling purchaser problem
• Models for a traveling purchaser problem with additional side-constraints
• A linear-size model for the single picker routing problem with scattered storage
• Solving the asymmetric traveling purchaser problem

This page was built for publication: A branch and bound algorithm for the traveling purchaser problem

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