Exact and heuristic algorithms for routing problems
Battarra, Maria (2011) Exact and heuristic algorithms for routing problems. 4OR: A Quarterly Journal of Operations Research, 1-4. (doi:10.1007/s10288-010-0141-9).
Download
Full text not available from this repository.
Description/Abstract
This is a summary of the authors PhD thesis supervised by Daniele Vigo and defended on 30 March 2010, at the Università di Bologna. The thesis is written in English and is available from the author upon request. Several rich routing problems attaining to the transportation area have been studied. “Simple” algorithms have been proposed to solve them, both exact and heuristic, producing high quality solutions and transferrable methods
| Item Type: | Article |
|---|---|
| ISSNs: | 1619-4500 (print) 1614-2411 (electronic) |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Social and Human Sciences > Mathematical Sciences > Operational Research |
| Item ID: | 204857 |
| Date Deposited: | 02 Dec 2011 14:37 |
| Last Modified: | 02 Dec 2011 14:37 |
| Contributors: | Battarra, Maria (Author) |
| Date: | 2011 |
| Status: | Unpublished |
| Publisher: | Springer Berlin / Heidelberg |
| URI: | http://eprints.soton.ac.uk/id/eprint/204857 |
Actions (login required)
 |
View Item |
