A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem

DOI10.1287/OPRE.51.6.940.24921MaRDI QIDQ3637400zbMATH OpenOpenAlexFDO

Authors G. 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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A branch and bound algorithm for the traveling purchaser problem
• The biobjective travelling purchaser problem
• Solving the asymmetric traveling purchaser problem
• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem

Cited in

(35)

• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
• Ant colony optimization for the traveling purchaser problem
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• An iterated local search algorithm for the traveling purchaser problem
• A unifying framework for selective routing problems
• Regulating the rebound effect in the traveling purchaser problem
• The traveling purchaser problem with time-dependent quantities
• Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
• New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty
• scientific article; zbMATH DE number 1769325 (Why is no real title available?)
• Models for a traveling purchaser problem with additional side-constraints
• A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
• Effective algorithms for a bounded version of the uncapacitated TPP
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
• Exploring greedy criteria for the dynamic traveling purchaser problem
• Dual-driven path elimination for vehicle routing with idle times and arrival-time consistency
• Logic-Based Decomposition Methods for the Travelling Purchaser Problem
• The traveling purchaser problem with fast service option
• The traveling purchaser problem with budget constraint
• A heuristic approach for the travelling purchaser problem
• Solving the asymmetric traveling purchaser problem
• A branch-and-cut algorithm for the target visitation problem
• An exact algorithm for the capacitated total quantity discount problem
• The traveling purchaser problem and its variants
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
• The bi-objective traveling purchaser problem with deliveries
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants
• Heuristics for the traveling purchaser problem
• The biobjective travelling purchaser problem
• A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
• The distance constrained multiple vehicle traveling purchaser problem
• A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme

Describes a project that uses

Uses Software

• ABACUS

This page was built for publication: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem

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