A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
From MaRDI portal
Publication:3637400
DOI10.1287/opre.51.6.940.24921zbMath1165.90659OpenAlexW2158175311MaRDI QIDQ3637400
Gilbert Laporte, Jorge Riera-Ledesma, Juan-José Salazar-González
Publication date: 9 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0555e4008821f2918cdf2a5d98c766896e03a7e6
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (25)
The bi-objective traveling purchaser problem with deliveries ⋮ New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty ⋮ The biobjective travelling purchaser problem ⋮ The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach ⋮ Ant colony optimization for the traveling purchaser problem ⋮ The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach ⋮ The traveling purchaser problem with time-dependent quantities ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines ⋮ Solving the asymmetric traveling purchaser problem ⋮ The traveling purchaser problem with fast service option ⋮ An exact algorithm for the capacitated total quantity discount problem ⋮ A GRASP/Path‐Relinking algorithm for the traveling purchaser problem ⋮ Exploring greedy criteria for the dynamic traveling purchaser problem ⋮ A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs ⋮ The traveling purchaser problem and its variants ⋮ Outer approximation and submodular cuts for maximum capture facility location problems with random utilities ⋮ The distance constrained multiple vehicle traveling purchaser problem ⋮ Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach ⋮ 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 ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants ⋮ Effective Algorithms for a Bounded Version of the Uncapacitated TPP ⋮ Heuristics for the traveling purchaser problem
Uses Software
This page was built for publication: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
