Home > Research > Publications & Outputs > New inequalities for the general routing problem

Research

Links

Text available via DOI:

Keywords

View graph of relations

New inequalities for the general routing problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

New inequalities for the general routing problem. / Letchford, A. N.
In: European Journal of Operational Research, Vol. 96, No. 2, 24.01.1997, p. 317-322.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Letchford, AN 1997, 'New inequalities for the general routing problem', European Journal of Operational Research, vol. 96, no. 2, pp. 317-322. https://doi.org/10.1016/S0377-2217(96)00346-3

APA

Letchford, A. N. (1997). New inequalities for the general routing problem. European Journal of Operational Research, 96(2), 317-322. https://doi.org/10.1016/S0377-2217(96)00346-3

Vancouver

Letchford AN. New inequalities for the general routing problem. European Journal of Operational Research. 1997 Jan 24;96(2):317-322. doi: 10.1016/S0377-2217(96)00346-3

Author

Letchford, A. N. / New inequalities for the general routing problem. In: European Journal of Operational Research. 1997 ; Vol. 96, No. 2. pp. 317-322.

Bibtex

@article{1b6b7ae23c684acb8bb0bd678b0aa8ff,
title = "New inequalities for the general routing problem",
abstract = "A large new class of valid inequalities is introduced for the General routing Problem which properly contains the class of {"}K-C constraints{"}. These are also valid for the Rural Postman Problem. A separation algorithm is given for a subset of these inequalities which runs in polynomial time.",
keywords = "arc routing problems, polyhedral combinatorics, General Routing Problem, Valid inequalities, Separation algorithms",
author = "Letchford, {A. N.}",
year = "1997",
month = jan,
day = "24",
doi = "10.1016/S0377-2217(96)00346-3",
language = "English",
volume = "96",
pages = "317--322",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier Science B.V.",
number = "2",

}

RIS

TY - JOUR

T1 - New inequalities for the general routing problem

AU - Letchford, A. N.

PY - 1997/1/24

Y1 - 1997/1/24

N2 - A large new class of valid inequalities is introduced for the General routing Problem which properly contains the class of "K-C constraints". These are also valid for the Rural Postman Problem. A separation algorithm is given for a subset of these inequalities which runs in polynomial time.

AB - A large new class of valid inequalities is introduced for the General routing Problem which properly contains the class of "K-C constraints". These are also valid for the Rural Postman Problem. A separation algorithm is given for a subset of these inequalities which runs in polynomial time.

KW - arc routing problems

KW - polyhedral combinatorics

KW - General Routing Problem

KW - Valid inequalities

KW - Separation algorithms

U2 - 10.1016/S0377-2217(96)00346-3

DO - 10.1016/S0377-2217(96)00346-3

M3 - Journal article

VL - 96

SP - 317

EP - 322

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -