A branch‐and‐cut‐and‐price algorithm for the mixed capacitated general routing problem. Issue 3 (22nd August 2016)
- Record Type:
- Journal Article
- Title:
- A branch‐and‐cut‐and‐price algorithm for the mixed capacitated general routing problem. Issue 3 (22nd August 2016)
- Main Title:
- A branch‐and‐cut‐and‐price algorithm for the mixed capacitated general routing problem
- Authors:
- Bach, Lukas
Lysgaard, Jens
Wøhlk, Sanne - Abstract:
- Abstract : In this paper, we consider the Mixed Capacitated General Routing Problem which is a combination of the Capacitated Vehicle Routing Problem and the Capacitated Arc Routing Problem. The problem is also known as the Node, Edge, and Arc Routing Problem. We propose a Branch‐and‐Cut‐and‐Price algorithm for obtaining optimal solutions to the problem and present computational results based on a set of standard benchmark instances. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 68(3), 161–184 2016
- Is Part Of:
- Networks. Volume 68:Issue 3(2016)
- Journal:
- Networks
- Issue:
- Volume 68:Issue 3(2016)
- Issue Display:
- Volume 68, Issue 3 (2016)
- Year:
- 2016
- Volume:
- 68
- Issue:
- 3
- Issue Sort Value:
- 2016-0068-0003-0000
- Page Start:
- 161
- Page End:
- 184
- Publication Date:
- 2016-08-22
- Subjects:
- Mixed Capacitated General Routing Problem -- Branch‐And‐Cut‐And‐Price -- The Node, Edge, And Arc Routing Problem -- Mixed Capacitated General Routing Problem
Network analysis (Planning) -- Periodicals
658.4032 - Journal URLs:
- http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-0037 ↗
http://onlinelibrary.wiley.com/ ↗ - DOI:
- 10.1002/net.21690 ↗
- Languages:
- English
- ISSNs:
- 0028-3045
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 6077.205000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 1919.xml