Limited memory Rank-1 Cuts for Vehicle Routing Problems

Published 2017 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Limited memory Rank-1 Cuts for Vehicle Routing Problems
Authors
Keywords
Set Partitioning, Polyhedral combinatorics, Branch-cut-and-price algorithms
Journal
OPERATIONS RESEARCH LETTERS
Volume 45, Issue 3, Pages 206-209
Publisher
Elsevier BV
Online
2017-02-24
DOI
10.1016/j.orl.2017.02.006

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

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
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.