Pickup and delivery problem with incompatibility constraints
Authors:
- Pablo FactorovichPFPablo Factorovich
- Isabel Méndez-DíazIMIsabel Méndez-Díaz
- Paula ZabalaPZPaula Zabala
- 1 January 2020
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 113
Abstract
No abstract availableKeywords
Funding Information
- Fondo para la Investigación Científica y Tecnológica
- Fondo para la Investigación Científica y Tecnológica
- Universidad de Buenos Aires
This publication has 31 references indexed in Scilit:
- Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approachComputers & Operations Research, 2012
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problemComputers & Operations Research, 2009
- The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithmMathematical Programming, 2008
- The transportation problem with exclusionary side constraints4OR, 2008
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraintsOperations Research Letters, 2005
- Heuristics and lower bounds for the bin packing problem with conflictsComputers & Operations Research, 2004
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithmsEuropean Journal of Operational Research, 2002
- Solving transportation problems with nonlinear side constraints with tabu searchComputers & Operations Research, 1995
- New methods to color the vertices of a graphCommunications of the ACM, 1979