The rural postman problem with deadline classes
type: Item
instance of: scholarly article
title: The rural postman problem with deadline classes
zbMATH Open document ID: 0955.90111
DOI: 10.1016/S0377-2217(97)00090-8
author: Adam N. Letchford
author: Richard Eglese
published in: European Journal of Operational Research
publication date: 2001-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1299931
zbMATH Keywords: rural postman problem
zbMATH Keywords: time windows
zbMATH Keywords: integer programming
zbMATH Keywords: cutting-planes
Wikidata QID: Q57702400
MaRDI profile type: Publication
cites work: Q4234150
cites work: A polyhedral approach to the rural postman problem
cites work: The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
cites work: Q5687193
cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
cites work: Arc Routing Problems, Part I: The Chinese Postman Problem
cites work: Arc Routing Problems, Part II: The Rural Postman Problem
cites work: Separating maximally violated comb inequalities in planar graphs
cites work: Q4198056
cites work: On general routing problems
cites work: New inequalities for the general routing problem
cites work: Q4040221
cites work: A fundamental problem in vehicle routing
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: Algorithms for the Vehicle Routing Problems with Time Deadlines
full work available at URL: s0377-2217(97)00090-8
OpenAlex ID: W2091251824
description: scientific article; zbMATH DE number 1299931