Title of article
The pickup and delivery problem: Faces and branch-and-cut algorithm
Author/Authors
K. S. Ruland، نويسنده , , E. Y. Rodin، نويسنده ,
Issue Information
هفته نامه با شماره پیاپی سال 1997
Pages
13
From page
1
To page
13
Abstract
This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.
Keywords
Branch-and-cut algorithm , Integer programming , Pickup and delivery problem
Journal title
Computers and Mathematics with Applications
Serial Year
1997
Journal title
Computers and Mathematics with Applications
Record number
918062
Link To Document