Models for a traveling purchaser problem with additional side-constraints

DOI10.1016/j.cor.2010.07.016zbMath1231.90089OpenAlexW1977271917MaRDI QIDQ709202

Stefan Voß, Ana Paias, Luís Gouveia

Publication date: 15 October 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.07.016

zbMATH Keywords

dynamic programmingtraveling purchaser problemdiscretized (time-dependent) formulationstate space relaxation

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39) Methods of reduced gradient type (90C52)

Related Items (8)

The bi-objective traveling purchaser problem with deliveries ⋮ Optimal capacitated ring trees ⋮ The traveling purchaser problem with time-dependent quantities ⋮ The traveling purchaser problem with fast service option ⋮ A GRASP/Path‐Relinking algorithm for the traveling purchaser problem ⋮ The traveling purchaser problem and its variants ⋮ The distance constrained multiple vehicle traveling purchaser problem ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants

Uses Software

• BRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exploring greedy criteria for the dynamic traveling purchaser problem
• Applying the corridor method to a blocks relocation problem
• A heuristic approach for the travelling purchaser problem
• Solving the asymmetric traveling purchaser problem
• The traveling purchaser problem with budget constraint
• Travelling purchaser problem
• A branch and bound algorithm for the traveling purchaser problem
• Improved solutions for the traveling purchaser problem.
• Improved heuristics for the traveling purchaser problem.
• The traveling salesman problem and its variations
• Approximate algorithms for the travelling purchaser problem
• Heuristics for the traveling purchaser problem
• Dynamic tabu search strategies for the traveling purchaser problem
• Ant colony optimization for the traveling purchaser problem
• Automatic production planning of press brakes for sheet metal bending
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• Matheuristics
• State-space relaxation procedures for the computation of bounds to routing problems
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Validation of subgradient optimization
• Sequencing many jobs on a multi-purpose facility
• Effective Algorithms for a Bounded Version of the Uncapacitated TPP

This page was built for publication: Models for a traveling purchaser problem with additional side-constraints