Approximation algorithms for some extensions of the maximum profit routing problem
type: Item
instance of: scholarly article
title: Approximation algorithms for some extensions of the maximum profit routing problem
author: Bogdan Armaselu
published in: Journal of Combinatorial Optimization
publication date: 2022-12-08T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 7629811
zbMATH Keywords: routing
zbMATH Keywords: maximum-profit
zbMATH Keywords: variable supply
zbMATH Keywords: multiple vehicles
zbMATH Keywords: APX
MaRDI profile type: Publication
full work available at URL: s10878-022-00944-0
OpenAlex ID: W4311653224
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: Approximation algorithms for deadline-TSP and vehicle routing with time-windows
cites work: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
cites work: Vehicle Routing with Time Windows: Two Optimization Algorithms
cites work: Capacitated arc routing problems
cites work: New inapproximability bounds for TSP
cites work: Faster Pseudopolynomial Time Algorithms for Subset Sum
cites work: The Traveling Salesman Problem with Distances One and Two
cites work: P-Complete Approximation Problems
cites work: Constant-factor approximations for capacitated arc routing without triangle inequality
DOI: 10.1007/S10878-022-00944-0
Recommended article: Optimal solutions for routing problems with profits
Recommended article: Approximation algorithms for some vehicle routing problems
Recommended article: An approximation algorithm for the general routing problem
Recommended article: Approximation results for a min-max location-routing problem
Recommended article: Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems
Recommended article: Approximation algorithms for a vehicle routing problem
Recommended article: Approximations for minimum and min-max vehicle routing problems
Recommended article: Complexity and approximation for traveling salesman problems with profits
Recommended article: The undirected capacitated general routing problem with profits
describes a project that uses: GitHub
description: scientific article; zbMATH DE number 7629811