Models for a traveling purchaser problem with additional side-constraints
type: Item
instance of: scholarly article
title: Models for a traveling purchaser problem with additional side-constraints
zbMATH Open document ID: 1231.90089
author: Ana Paias
author: Stefan Voß
author: Luis Gouveia
published in: Computers \& Operations Research
publication date: 2010-10-15T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 5800842
zbMATH Keywords: traveling purchaser problem
zbMATH Keywords: dynamic programming
zbMATH Keywords: state space relaxation
zbMATH Keywords: discretized (time-dependent) formulation
describes a project that uses: BRP
MaRDI profile type: Publication
full work available at URL: j.cor.2010.07.016
OpenAlex ID: W1977271917
cites work: Exploring greedy criteria for the dynamic traveling purchaser problem
cites work: Heuristics for the traveling purchaser problem
cites work: Ant colony optimization for the traveling purchaser problem
cites work: Sequencing many jobs on a multi-purpose facility
cites work: Applying the corridor method to a blocks relocation problem
cites work: Automatic production planning of press brakes for sheet metal bending
cites work: State-space relaxation procedures for the computation of bounds to routing problems
cites work: The traveling salesman problem and its variations
cites work: Validation of subgradient optimization
cites work: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
cites work: Q3677509
cites work: Matheuristics
cites work: Effective Algorithms for a Bounded Version of the Uncapacitated TPP
cites work: The traveling purchaser problem with budget constraint
cites work: Approximate algorithms for the travelling purchaser problem
cites work: Improved solutions for the traveling purchaser problem.
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: Travelling purchaser problem
cites work: Q4938770
cites work: A heuristic approach for the travelling purchaser problem
cites work: Solving the asymmetric traveling purchaser problem
cites work: A branch and bound algorithm for the traveling purchaser problem
cites work: Q3437242
cites work: Improved heuristics for the traveling purchaser problem.
cites work: Dynamic tabu search strategies for the traveling purchaser problem
DOI: 10.1016/J.COR.2010.07.016
description: scientific article; zbMATH DE number 5800842