Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
Authors
Keywords
Vehicle routing with pickups and deliveries, Loading constraints, Column generation, Branch-price-and-cut, Valid inequalities
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 250, Issue 3, Pages 782-793
Publisher
Elsevier BV
Online
2015-10-31
DOI
10.1016/j.ejor.2015.10.046

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.