A branch and bound algorithm for the traveling purchaser problem

DOI10.1016/S0377-2217(96)00313-XzbMath0919.90141MaRDI QIDQ1278659

Kashi N. Singh, Dirk D. L. van Oudheusden

Publication date: 23 August 1999

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

zbMATH Keywords

schedulingtraveling salesmanbranch-and-boundroutingwarehousingplant locationtraveling purchaser

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (21)

The bi-objective traveling purchaser problem with deliveries ⋮ The biobjective travelling purchaser problem ⋮ Ant colony optimization for the traveling purchaser problem ⋮ The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach ⋮ Solving the asymmetric traveling purchaser problem ⋮ The traveling purchaser problem with fast service option ⋮ 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 ⋮ Improved heuristics for the traveling purchaser problem. ⋮ The traveling purchaser problem and its variants ⋮ An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem ⋮ A heuristic approach for the travelling purchaser problem ⋮ Models for a traveling purchaser problem with additional side-constraints ⋮ The traveling purchaser problem with budget constraint ⋮ Transgenetic algorithm for the traveling purchaser problem ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants ⋮ Effective Algorithms for a Bounded Version of the Uncapacitated TPP ⋮ Automatic production planning of press brakes for sheet metal bending ⋮ Heuristics for the traveling purchaser problem

Cites Work

• Travelling purchaser problem
• Approximate algorithms for the travelling purchaser problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Dual-Based Procedure for Dynamic Facility Location
• An Algorithm for the Traveling Salesman Problem
• Sequencing many jobs on a multi-purpose facility
• Unnamed Item

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