Document Zbl 0652.90097

Structured Search

Help

Examples

Geometry Search for the term Geometry in any field. Queries are case-independent.

Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.

"Topological group" Phrases (multi-words) should be set in "straight quotation marks".

au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.

Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.

Quasi* map* py: 1989 The resulting documents have publication year 1989.

so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.

"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.

dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.

py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).

la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Fields

any	anywhere
an	internal document identifier
au	author, editor
ai	internal author identifier
ti	title
la	language
so	source
ab	review, abstract
py	publication year
rv	reviewer
cc	MSC code
ut	uncontrolled term
dt	document type (j: journal article; b: book; a: book article)

Operators

a & b	logic and
a \| b	logic or
!ab	logic not
abc*	right wildcard
"ab c"	phrase
(ab c)	parentheses

Desrochers, Martin; Soumis, François

A generalized permanent labelling algorithm for the shortest path problem with time windows. (English) Zbl 0652.90097

INFOR 26, No. 3, 191-212 (1988).

The shortest path problem with time windows is to find the least cost route between two nodes while satisfying specified time windows at each visited node. The authors present a generalized permanent labelling algorithm to solve the problem. Some computational results on randomly generated problems are presented.

Reviewer: Lau Hang-Tong

Cited in 72 Documents

MSC:

90C35	Programming involving graphs or networks
90C39	Dynamic programming

Keywords:

shortest path problem with time windows; least cost route; generalized permanent labelling algorithm

PDF BibTeX XML Cite

Full Text: DOI