Home > Research > Publications & Outputs > A constraint programming approach to the Chines...
View graph of relations

A constraint programming approach to the Chinese Postman Problem with time windows

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

A constraint programming approach to the Chinese Postman Problem with time windows. / Aminu, F U; Eglese, R W.
In: Computers and Operations Research, Vol. 33, No. 12, 2006, p. 3423-3431.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Aminu, FU & Eglese, RW 2006, 'A constraint programming approach to the Chinese Postman Problem with time windows', Computers and Operations Research, vol. 33, no. 12, pp. 3423-3431.

APA

Aminu, F. U., & Eglese, R. W. (2006). A constraint programming approach to the Chinese Postman Problem with time windows. Computers and Operations Research, 33(12), 3423-3431.

Vancouver

Aminu FU, Eglese RW. A constraint programming approach to the Chinese Postman Problem with time windows. Computers and Operations Research. 2006;33(12):3423-3431.

Author

Aminu, F U ; Eglese, R W. / A constraint programming approach to the Chinese Postman Problem with time windows. In: Computers and Operations Research. 2006 ; Vol. 33, No. 12. pp. 3423-3431.

Bibtex

@article{f9f64dfed1214d11a673d287d215b692,
title = "A constraint programming approach to the Chinese Postman Problem with time windows",
author = "Aminu, {F U} and Eglese, {R W}",
year = "2006",
language = "English",
volume = "33",
pages = "3423--3431",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",
number = "12",

}

RIS

TY - JOUR

T1 - A constraint programming approach to the Chinese Postman Problem with time windows

AU - Aminu, F U

AU - Eglese, R W

PY - 2006

Y1 - 2006

M3 - Journal article

VL - 33

SP - 3423

EP - 3431

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 12

ER -