The traveling purchaser problem and its variants
type: Item
instance of: scholarly article
title: The traveling purchaser problem and its variants
zbMATH Open document ID: 1394.90487
author: Daniele Manerba
author: Renata Mansini
author: Jorge Riera-Ledesma
published in: European Journal of Operational Research
publication date: 2018-05-25T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 6873577
zbMATH Keywords: routing
zbMATH Keywords: traveling purchaser problem
zbMATH Keywords: supplier selection
zbMATH Keywords: exact and heuristic methods
describes a project that uses: LKH
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.12.017
OpenAlex ID: W2564703335
cites work: Supplier selection and order lot sizing modeling: a review
cites work: An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
cites work: Exploring greedy criteria for the dynamic traveling purchaser problem
cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: Q4509381
cites work: The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
cites work: The Traveling Salesman Problem: A Survey
cites work: The distance constrained multiple vehicle 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: Automatic production planning of press brakes for sheet metal bending
cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
cites work: Q4461915
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
cites work: Transgenetic algorithm for the traveling purchaser problem
cites work: A new approach to the maximum-flow problem
cites work: Beyond the flow decomposition barrier
cites work: Models for a traveling purchaser problem with additional side-constraints
cites work: Q3714900
cites work: The traveling salesman problem and its variations
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: The traveling purchaser problem with stochastic prices: exact and approximate algorithms
cites work: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: An exact algorithm for the capacitated total quantity discount problem
cites work: An effective matheuristic for the capacitated total quantity discount problem
cites work: Effective Algorithms for a Bounded Version of the Uncapacitated TPP
cites work: The traveling purchaser problem with budget constraint
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Approximate algorithms for the travelling purchaser problem
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: Improved solutions for the traveling purchaser problem.
cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
cites work: Travelling purchaser problem
cites work: Q4938770
cites work: A heuristic approach for the travelling purchaser problem
cites work: The biobjective travelling purchaser problem
cites work: Solving the asymmetric traveling purchaser problem
cites work: Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
cites work: A column generation approach for a school bus routing problem with resource constraints
cites work: A branch and bound algorithm for the traveling purchaser problem
cites work: Improved heuristics for the traveling purchaser problem.
cites work: Vehicle Routing
cites work: Dynamic tabu search strategies for the traveling purchaser problem
DOI: 10.1016/J.EJOR.2016.12.017
description: scientific article; zbMATH DE number 6873577