Fast approximation algorithms for routing problems with hop-wise constraints
type: Item
instance of: scholarly article
title: Fast approximation algorithms for routing problems with hop-wise constraints
zbMATH Open document ID: 1303.90089
author: Amir Elalouf
published in: Annals of Operations Research
publication date: 2015-01-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6389173
zbMATH Keywords: approximation algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: shortest path
zbMATH Keywords: routing
MaRDI profile type: Publication
full work available at URL: s10479-013-1308-5
OpenAlex ID: W2002806127
cites work: A branch and bound method for the job-shop problem with sequence-dependent setup times
cites work: Q4929399
cites work: A survey of recent developments in multiobjective optimization
cites work: Introduction to algorithms
cites work: Scheduler -- a system for staff planning
cites work: An improved FPTAS for Restricted Shortest Path.
cites work: A survey on multi-constrained optimal path computation: exact and approximate algorithms
cites work: Fast approximation algorithm for job sequencing with deadlines
cites work: A dual algorithm for the constrained shortest path problem
cites work: Approximation Schemes for the Restricted Shortest Path Problem
cites work: The shortest path problem with two objective functions
cites work: An improved FPTAS for mobile agent routing with time constraints
cites work: A simple efficient approximation scheme for the restricted shortest path problem
DOI: 10.1007/S10479-013-1308-5
description: scientific article; zbMATH DE number 6389173