Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

Published

**Polyhedral theory for arc routing problems.** / Eglese, R. W.; Letchford, A. N.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

Eglese, RW & Letchford, AN 2000, Polyhedral theory for arc routing problems. in *Arc routing : theory, solutions and applications.* Kluwer Academic Publishers, Dordrecht, pp. 199-230. https://doi.org/10.1007/978-1-4615-4495-1_6

Eglese, R. W., & Letchford, A. N. (2000). Polyhedral theory for arc routing problems. In *Arc routing : theory, solutions and applications *(pp. 199-230). Kluwer Academic Publishers. https://doi.org/10.1007/978-1-4615-4495-1_6

Eglese RW, Letchford AN. Polyhedral theory for arc routing problems. In Arc routing : theory, solutions and applications. Dordrecht: Kluwer Academic Publishers. 2000. p. 199-230 doi: 10.1007/978-1-4615-4495-1_6

@inbook{c81edd3e42e344d99b58f4af38bdad4e,

title = "Polyhedral theory for arc routing problems",

abstract = "As explained in Chapter 4, most realistic Arc Routing Problems are known to be NP-hard. Therefore we can expect that there will be certain instances which are impossible to solve to optimality within a reasonable time. However, this does not mean that all instances will be impossible to solve. It may well be that an instance which arises in practice has some structure which makes it amenable to solution by an optimization algorithm. Since, in addition, significant costs are often involved in realworld instances, research into devising optimization algorithms is still regarded as important.",

author = "Eglese, {R. W.} and Letchford, {A. N.}",

year = "2000",

doi = "10.1007/978-1-4615-4495-1_6",

language = "English",

isbn = "0792378989",

pages = "199--230",

booktitle = "Arc routing",

publisher = "Kluwer Academic Publishers",

}

TY - CHAP

T1 - Polyhedral theory for arc routing problems

AU - Eglese, R. W.

AU - Letchford, A. N.

PY - 2000

Y1 - 2000

N2 - As explained in Chapter 4, most realistic Arc Routing Problems are known to be NP-hard. Therefore we can expect that there will be certain instances which are impossible to solve to optimality within a reasonable time. However, this does not mean that all instances will be impossible to solve. It may well be that an instance which arises in practice has some structure which makes it amenable to solution by an optimization algorithm. Since, in addition, significant costs are often involved in realworld instances, research into devising optimization algorithms is still regarded as important.

AB - As explained in Chapter 4, most realistic Arc Routing Problems are known to be NP-hard. Therefore we can expect that there will be certain instances which are impossible to solve to optimality within a reasonable time. However, this does not mean that all instances will be impossible to solve. It may well be that an instance which arises in practice has some structure which makes it amenable to solution by an optimization algorithm. Since, in addition, significant costs are often involved in realworld instances, research into devising optimization algorithms is still regarded as important.

U2 - 10.1007/978-1-4615-4495-1_6

DO - 10.1007/978-1-4615-4495-1_6

M3 - Chapter (peer-reviewed)

SN - 0792378989

SP - 199

EP - 230

BT - Arc routing

PB - Kluwer Academic Publishers

CY - Dordrecht

ER -