A new formulation for the traveling deliveryman problem
type: Item
instance of: scholarly article
title: A new formulation for the traveling deliveryman problem
zbMATH Open document ID: 1155.90471
author: Isabel Méndez-Díaz
author: Paula Zabala
author: Abilio Lucena
published in: Discrete Applied Mathematics
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 5522964
zbMATH Keywords: traveling deliveryman problem
zbMATH Keywords: integer programming
zbMATH Keywords: branch-and-cut algorithms
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.dam.2008.05.009
OpenAlex ID: W2088342306
cites work: The complexity of the travelling repairman problem
cites work: Q4471278
cites work: Approximation schemes for minimum latency problems
cites work: Q4503935
cites work: The minimum latency problem
cites work: Q3689218
cites work: On-line single-server dial-a-ride problems
cites work: The Delivery Man Problem and Cumulative Matroids
cites work: An improved approximation ratio for the minimum latency problem
cites work: A General Approximation Technique for Constrained Forest Problems
cites work: Facets of the linear ordering polytope
cites work: Q4818841
cites work: News from the online traveling repairman.
cites work: Time‐dependent traveling salesman problem–the deliveryman case
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: P-Complete Approximation Problems
cites work: Q4737530
cites work: Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem
cites work: Exact algorithms for the minimum latency problem
DOI: 10.1016/J.DAM.2008.05.009
description: scientific article; zbMATH DE number 5522964