Lancaster EPrints

Polyhedral theory for arc routing problems

Eglese, R. W. and Letchford, A. N. (2000) Polyhedral theory for arc routing problems. In: Arc routing. Kluwer Academic Publishers, Dordrecht, pp. 199-230. ISBN 0792378989

Full text not available from this repository.


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.

Item Type: Contribution in Book/Report/Proceedings
Departments: Lancaster University Management School > Management Science
ID Code: 45885
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 20:52
Refereed?: Yes
Published?: Published
Last Modified: 04 Nov 2015 05:35
Identification Number:

Actions (login required)

View Item